Better approximation schemes for disk graphs

Authors:
Erik Jan van Leeuwen
Affiliations:
CWI, Amsterdam, The Netherlands
Venue:
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Year:
2006

Citing 15
Cited 8

Unit disk graphs

Discrete Mathematics - Topics on domination
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)
Separators for sphere-packings and nearest neighbor graphs

Journal of the ACM (JACM)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Algorithms for Vertex Partitioning Problems on Partial k-Trees

SIAM Journal on Discrete Mathematics
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs

JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Polynomial-time approximation schemes for packing and piercing fat objects

Journal of Algorithms
Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs

Journal of Algorithms
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
Efficient approximation schemes for geometric problems?

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximation algorithms for unit disk graphs

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
A robust PTAS for maximum weight independent sets in unit disk graphs

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
A Deterministic Linear Time Algorithm For Geometric Separators And Its Applications

Fundamenta Informaticae

Approximating geometric coverage problems

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Multiflows in multihop wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Minimum Interference Planar Geometric Topology in Wireless Sensor Networks

WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Domination in geometric intersection graphs

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Minimum vertex cover in rectangle graphs

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Minimum vertex cover in rectangle graphs

Computational Geometry: Theory and Applications
Tracking moving objects with few handovers

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Optimization problems in dotted interval graphs

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider Maximum Independent Set and Minimum Vertex Cover on disk graphs. We propose an asymptotic FPTAS for Minimum Vertex Cover on disk graphs of bounded ply. This scheme can be extended to an EPTAS on arbitrary disk graphs, improving on the previously known PTAS [8]. We introduce the notion of level density for disk graphs, which is a generalization of the notion of ply. We give an asymptotic FPTAS for Maximum Independent Set on disk graphs of bounded level density, which is also a PTAS on arbitrary disk graphs. The schemes are a geometric generalization of Baker's EPTASs for planar graphs [3]