140
click to vote
ALGORITHMICA
2008
15 years 3 months ago
2008
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion