Maximum coverage problem: Difference between revisions

Revision as of 07:13, 8 June 2015

Revision as of 18:41, 9 July 2015

Line 73:

* [[Set cover problem]] is to cover all elements with as few sets as possible.

== ReferencesNotes ==

{{Reflist}}

== References ==

* {{Cite book | last=Vazirani | first=Vijay V. | authorlink=Vijay Vazirani | title=Approximation Algorithms | year=2001 | publisher=Springer-Verlag | isbn=3-540-65367-8 | pages=}}

* [[{{cite article | last = Feige | first = Uriel | authorlink = Uriel Feige]], ''| title = A Threshold of ln <math>''n</math>'' for Approximating Set Cover'', | journal = Journal of the ACM (JACM),| volume = v.45 n.| number = 4, p.&nbsp;634| -month 652,= July | year = 1998 | issn = 0004-5411 | pages = 634–652 | doi = 10.1145/285055.285059 | publisher = Association for Computing Machinery | ___location = New York, NY, USA}}

== External links ==