Minimum Clique Partition in Unit Disk Graphs

Graphs and Combinatorics

Volumn 27, Issue 3, 2011, Pages 399-411

  Dumitrescu, Adrian ^a   Pach, János ^b  

^a UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

^b CITY COLLEGE OF NEW YORK   (United States)

Author keywords

Clique partition; Unit disk graph

Indexed keywords

EID: 79954628983     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00373-011-1026-1     Document Type: Article

References (27)

1. Ambühl, C., Erlebach, T., Mihalák, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proceedings of APPROX-RANDOM. Lecture Notes in Computer Science, vol. 4110, pp. 3-14. Springer, Berlin (2006).
2. Balasundaram, B., Butenko, S.: Optimization problems in unit-disk graphs. In: Floudas, C. A., Pardalos, P. M. (eds.) Encyclopedia of Optimization, pp. 2832-2844. Springer, Berlin (2008).
3. Breu, H.: Algorithmic aspects of constrained unit disk graphs, PhD Thesis, University of British Columbia, (1996).
4. Breu H., Kirkpatrick D.: Unit disk graph recognition is NP-hard. Comput. Geom. Theory Appl. 9(1-2), 3-24 (1998).
5. Capolyleas V., Rote G., Woeginger G.: Geometric clusterings. J. Algorithms 12, 341-356 (1991).
6. Cassels J.: An Introduction to the Geometry of Numbers. Springer, New York (1959).
7. Cerioli M. R., Faria L., Ferreira T. O., Protti F.: On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation. Electron. Notes Discret. Math. 18, 73-79 (2004).
8. Clark B., Colbourn C., Johnson D.: Unit disk graphs. Discret. Math. 86, 165-177 (1990).
9. Dumitrescu, A., Pach, J.: Minimum clique partition in unit disk graphs, preprint, September 8, 2009. arXiv: 0909. 1552v1.
10. Edelsbrunner H., Robison A., Shen X.-J.: Covering convex sets with non-overlapping polygons. Discret. Math. 81, 153-164 (1990).
11. Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric graphs. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 671-679 (2001).
12. Erlebach, T., Leeuwen, E. J.: Approximating geometric coverage problems. In: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms, pp. 1267-1276 (2008).
13. Feder, T., Greene, D.: Optimal algorithms for approximate clustering. In: Proceedings of the 20th ACM Symposium on Theory of Computing, pp. 434-444 (1988).
14. Fejes Tóth L.: Some packing and covering theorems. Acta Scientiarum Mathematicarum (Szeged) 12/A, 62-67 (1950).
15. Golumbic M. C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980).
16. Halldórsson M. M.: A still better performance guarantee for approximate graph coloring. Inform. Process. Lett. 45(1), 19-23 (1993).
17. Hardy G. H., Wright E. M.: An Introduction to the Theory of Numbers, 5th edn. Oxford University Press, New York (1979).
18. Heppes A.: Filling a domain by disks. Periodica Mathematica Hungarica 8, 363-371 (1964).
19. Marathe M. V., Breu H., Hunt H. B. III, Ravi S. S., Rosenkrantz D. J.: Simple heuristics for unit disk graphs. Networks 25, 59-68 (1995).
20. Mitzenmacher M., Upfal E.: Probability and Computing. Cambridge University Press, London (2005).
21. Nieberg T., Hurink J., Kern W.: Approximation schemes for wireless networks. ACM Trans. Algorithms 4(4), 1-17 (2008).
22. Pach J., Agarwal P. K.: Combinatorial Geometry. John Wiley, New York (1995).
23. Pirwani, I., Salavatipour, M.: A PTAS for minimum clique partition in unit disk graphs, preprint, April 14, 2009. arXiv: 0904. 2203v1.
24. Pirwani, I., Salavatipour, M.: A weakly robust PTAS for minimum clique partition in unit disk graphs, preprint, December 3, 2009. arXiv: 0904. 2203v2.
25. Pirwani, I., Salavatipour, M.: A weakly robust PTAS for minimum clique partition in unit disk graphs. In: Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010, LNCS, Vol. 6139, pp. 188-199. Springer, Berlin (2010).
26. Supowit, K. J.: Topics in computational geometry, PhD Thesis, University of Illinois at Urbana-Champaign, Report UIUCDCS-R-81-1062 (1981).
27. Zuckerman D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. 3(1), 103-128 (2007).