Template talk:Covering/packing-problem pairs
 | This template does not require a rating on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||
| ||||||||
Are "pairs" here duals?[edit]
This template exhibits some "pairs" of problems. Clicking on the title drives to the notion of dual linear programs. Although some of the problems in this table are effectively duals (bin packing and bin covering for instance), others are NOT! For example, Minimum Vertex Cover is not the dual of Maximum Independent Set ; its dual is Maximum Matching. It introduces a lot of confusion... Mastergreg82 (talk) 12:54, 20 March 2022 (UTC)