Revision as of 05:12, 15 May 2010 edit 98.219.162.83 (talk) →Greedy algorithm ← Previous edit		Revision as of 09:25, 4 August 2010 edit undo 77.250.168.7 (talk) No edit summary Next edit →
Line 2: The '''maximum coverage problem''' is a classical question in [[computer science]] and [[computational complexity theory]]. It is a problem ~~whose~~that is widely taught in [[approximation algorithms]]. As input you are given several sets and a number <math>k</math>.

Maximum coverage problem: Difference between revisions