Latest Topics
- Saul
- Sesame Street, New York, New York
- Tricky
- Sevastopol: On Photographs of War
- Calva
- Lucius Malfoy
- Shadows of spawn
- Chris Beatrice
- Seventeenth of Tammuz
- LRC
Random Topics
Set cover problem
Summary
- The set cover problem (also set covering) is a classical question in computer science and complexity theory. As input you are given several sets.
Soundex: S321 ( S3 C16 P614 ) Metaphone: STKFRPRBLM Reference |
Similar Topics
- Vertex cover problem
- The Cover Girls
- Cover Up (film)
- Cover crop
- Exact cover
- Cover-up
- Cover (philately)
- Cover charge
- Cover letter
- Cover art
Related Topics
* This page is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Set cover problem".