On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation

Electronic Notes in Discrete Mathematics

Volumn 18, Issue , 2004, Pages 73-79

  Cerioli, M R ^a   Faria, L ^b   Ferreira, T O ^a   Protti, F ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b STATE UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

approximation algorithms; minimum clique partition; penny graph; unit coin graph; unit disk graph

Indexed keywords

EID: 34247132284     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2004.06.012     Document Type: Article

References (12)

1. Baker B.S. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM 41 1 (1994) 153-180
2. H. Breu, "Algorithmic Aspects of Constrained Unit Disk Graphs", PhD. Thesis, University of British Columbia, 1996
3. Breu H., and Kirkpatrick D.G. Unit disk graph recognition is NP-hard. Computational Geometry 9 (1998) 3-24
4. Clark B.N., Colbourn C.J., and Johnson D.S. Unit disk graphs. Discrete Mathematics 86 (1990) 165-177
5. T. Erlebach, K. Jansen and E. Seidel, Polynomial-time approximation schemes for geometric graphs, in "Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms", 2001, pp. 671-679
6. Garey M.R., and Johnson D.S. The rectilinear Steiner tree problem is NP-complete. SIAM Journal of Applied Mathematics 32 (1977) 826-834
7. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman, New York
8. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs (1980), Academic Press
9. Hunt III H.B., Marathe M.V., Radhakrishnan V., Ravi S.S., Rosenkrantz D.J., and Stearns R.E. NC-Approximation schemes for NP- and PSPACE-Hard problems for geometric graphs. Journal of Algorithms 26 (1998) 238-274
10. Marathe M.V., Breu H., Hunt III H.B., Ravi S.S., and Rosenkrantz D.J. Simple heuristics for unit disk graphs. Networks 25 (1995) 59-68
11. Matsui T. Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. Discrete and Computational Geometry. Lecture Notes in Computer Science 1763 (2000) 194-200
12. Valiant L.G. Universality considerations in VLSI circuits. IEEE Transactions on Computers 30 (1981) 135-140