1272 search results - page 29 / 255 » The Set Cover with Pairs Problem |
153
Voted
EPS
1998
Springer
15 years 7 months ago
1998
Springer
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
214
click to vote
GIS
2006
ACM
16 years 4 months ago
2006
ACM
We present a novel method for the automatic generalization of land cover maps. A land cover map is composed of areas that collectively form a tessellation of the plane and each ar...
149
click to vote
ML
2008
ACM
15 years 3 months ago
2008
ACM
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
117
click to vote
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
100
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We suggest a new, unconventional, way for solving the YES/NO version of the Exact Cover problem by using the massive parallelism of light. The idea is to build a device which can ...