Revision as of 13:53, 24 April 2010 edit Michael Hardy (talk \| contribs) Administrators 210,597 edits →General LP Formulation: lower case required by WP:MOS ← Previous edit		Revision as of 14:03, 24 April 2010 edit undo Michael Hardy (talk \| contribs) Administrators 210,597 edits No edit summary Next edit →
Line 2: Covering problems are [[Optimization (mathematics)\|minimization problem]]s and usually [[linear programs]], whose [[dual problem]]s are called [[packing problem]]s. The most prominent examples of covering problems are the [[~~Set~~set cover problem]], which is equivalent to the [[Hitting set\|~~Hitting~~hitting ~~Set~~set ~~Problem~~problem]], and its special cases, the [[~~Vertex~~vertex cover problem]] and the [[~~Edge~~edge cover problem]]. {{Covering-Packing_Problem_Pairs}}

Covering problems: Difference between revisions