Revision as of 18:24, 5 November 2009 edit Bender2k14 (talk \| contribs) Extended confirmed users 1,999 edits →Generalized maximum coverage algorithm: Fixed a typo ← Previous edit		Revision as of 09:33, 2 February 2010 edit undo 146.48.82.89 (talk) →Weighted version Next edit →
Line 30: == Weighted version == In the weighted version every element <math> e_j </math> has a weight ~~a weight~~ <math>w(e_j)</math>. The task is to find a maximum coverage which has maximum weight. The basic version is a special case when all weights are <math>1</math>. :maximize <math>\sum_{e \in E} w(e_j) \cdot y_j </math>. (maximizing the weighted sum of covered elements).

Maximum coverage problem: Difference between revisions