Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

@article{Erlebach2005PolynomialTimeAS,
  title={Polynomial-Time Approximation Schemes for Geometric Intersection Graphs},
  author={Thomas Erlebach and Klaus Jansen and Eike Seidel},
  journal={SIAM J. Comput.},
  year={2005},
  volume={34},
  pages={1302-1323}
}
A disk graph is the intersection graph of a set of disks with arbitrary diameters in the plane. For the case that the disk representation is given, we present polynomial-time approximation schemes (PTASs) for the maximum weight independent set problem (selecting disjoint disks of maximum total weight) and for the minimum weight vertex cover problem in disk graphs. These are the first known PTASs for NP-hard optimization problems on disk graphs. They are based on a novel recursive subdivision of… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 80 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 32 references

M

  • P. K. Agarwal
  • van Kreveld, and S. Suri, Label placement by…
  • 1998
Highly Influential
4 Excerpts

Approximation algorithms for NP-complete problems on planar graphs

  • B. S. Baker
  • J. ACM, 41
  • 1994
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…