1461 search results - page 18 / 293 » Complexity of Graph Covering Problems |
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rect...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
SPAA
1993
ACM
13 years 11 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
MST
2006
13 years 7 months ago
2006
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
COLT
1993
Springer
13 years 11 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...