42230 search results - page 153 / 8446 » Algorithms and Complexity Results for |
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
COCO
1994
Springer
15 years 2 months ago
1994
Springer
LCC
1994
15 years 2 months ago
1994
COCO
1989
Springer
15 years 2 months ago
1989
Springer
COR
2008
14 years 9 months ago
2008
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...