578 search results - page 49 / 116 » The Minimum-Entropy Set Cover Problem |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
COCO
2004
Springer
14 years 17 days ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
ALGOSENSORS
2006
Springer
14 years 17 days ago
2006
Springer
: We consider the broadcasting problem in sensor networks where the nodes have no prior knowledge of their neighbourhood. We describe several Area-based Beaconless Broadcasting Alg...
DISOPT
2006
13 years 8 months ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
WG
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...