Stability in circular arc graphs
Journal of Algorithms
Linear time algorithms on circular-arc graphs
Information Processing Letters
A rule-based system for dense-map name placement
Communications of the ACM
New clique and independent set algorithms for circle graphs
Discrete Applied Mathematics
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Label placement by maximum independent set in rectangles
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
On approximating rectangle tiling and packing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
Efficient approximation algorithms for tiling and packing problems with rectangles
Journal of Algorithms
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
SIAM Journal on Computing
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
On approximating a vertex cover for planar graphs
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
SIAM Journal on Computing
SIAM Journal on Computing
Optimization problems in multiple-interval graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Maximum independent set of rectangles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
Maximum independent set and maximum clique algorithms for overlap graphs
Discrete Applied Mathematics
Better approximation schemes for disk graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
A better approximation ratio for the vertex cover problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Efficient approximation schemes for geometric problems?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Coloring and maximum independent set of rectangles
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Implementation and comparison of heuristics for the vertex cover problem on huge graphs
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
| Hi-index | 0.00 |
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 rectangle families, rectangle families R where R1 \ R2 is connected for every pair of rectangles R1, R2 ∈ R. This algorithm extends to intersection graphs of pseudo-disks. The second algorithm achieves a factor of (1.5 + ε) in general rectangle families, for any fixed ε 0, and works also for the weighted variant of the problem. Both algorithms exploit the plane properties of axis-parallel rectangles.