Content deleted Content added
Piyush Sriva (talk | contribs) approximation factors for maximization problems are usually written so as to be less than 1 |
Piyush Sriva (talk | contribs) m Removed orphan tag (Submodular set function links here) |
||
Line 1:
The '''maximum coverage problem''' is a classical question in [[computer science]] and [[computational complexity theory]].
It is a problem that is widely taught in [[approximation algorithms]].
| |||