Computing Maximally Separated Sets in the Plane and Independent Sets in the Intersection Graph of Unit Disks

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 509-518

  Agarwal, Pankaj K ^a   Overmars, Mark ^b   Sharir, Micha ^c,d  

^a Duke University   (United States)

^b UTRECHT UNIVERSITY   (Netherlands)

^c TEL AVIV UNIVERSITY   (Israel)

^d NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; GRAPH THEORY; PROBLEM SOLVING;

DISK-INTERSECTION GRAPHS; MAXIMALLY SEPARATED SETS;

SET THEORY;

EID: 1842592035     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan, Approximating extent measures of points, J. ACM, to appear.
2. P. K. Agarwal, M. van Kreveld, and S. Suri. Label placement by maximum independent set in rectangles. Computational Geometry: Theory and Applications, 11 (1998), 209-218.
3. P. K. Agarwal and C. M. Procopiuc, Exact and approximation algorithms for clustering, Algorithmica 33 (2002), 201-226.
4. P. K. Agarwal, M. Sharir, and E. Welzl, The discrete 2-center problem, Discrete Comput. Geom. 20 (1998), 287-305.
5. J. Alber and J. Fiala, Geometric separation and exact solutions for the parameterized independent set problem on disk graphs, Proc. 2nd IFIP Intern. Conf. on Theoretical Computer Science, 2002, pp. 26-37.
6. M. de Berg, M. van Kreveld, M. H. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications (2nd ed.), Springer-Verlag, Heidelberg, 2000.
7. R. Boppana and M. M. Halldórsson. Approximating maximum independent sets by excluding subgraphs. Proc. 2nd Scandinavian Workshop on Algorithm Theory, 1990, 13-25.
8. B. N. Clark, C. J. Colbourn and D. S. Johnson, Unit disk graphs, Discrete Mathematics 86 (1990), 165-177.
9. T. Erlebach, K. Jansen, and E. Seidel. Polynomial-time approximation schemes for geometric graphs. In Proceedings of the Twelth Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, 671-679.
10. M. Formann and F. Wagner, A packing problem with applications to letter of maps, Proc. 7th Annu. Sympos. Comp. Geom., 1991, 281-288.
11. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979.
12. T. Gonzalez, Clustering to minimize the maximum intercluster distance, Theoret. Comput. Sci. 38 (1985), 293-306.
13. 1-ε. Acta Math., 182 (1999), 105-142.
14. J. Hershberger, Finding the upper envelope of n line segments in O(n log n) time, Inform. Process. Lett. 33 (1989), 169-174.
15. H. B. Hunt III, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns. NC-approximation schemes for NP-and PSPACE-hard problems for geometric graphs. J. Algorithms 26 (1998), 238-274.
16. M. Katz and M. Sharir, An expander-based approach to geometric optimization, SIAM J. Comput. 26 (1997), 1384-1408.
17. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, NY, 1995.
18. J. Vleugels and R. C. Veltkamp, Efficient image retrieval through vantage objects, Patt. Recog. 35 (2002), 69-80.