287 search results - page 13 / 58 » Exact Cover with light |
ESA
2005
Springer
14 years 28 days ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
DMCS
2003
13 years 8 months ago
2003
The problem of counting the number of monomer-dimer coverings of a lattice comes from the field of statistical mechanics. It has only been shown to be exactly solved for the speci...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
EOR
2010
13 years 2 months ago
2010
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
ACTA
2007
13 years 7 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...