On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation-Reference-Cited by-同舟云学术

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

Published:2004-12 Issue: Volume:18 Page:73-79
ISSN:1571-0653
Container-title:Electronic Notes in Discrete Mathematics
language:en
Short-container-title:Electronic Notes in Discrete Mathematics

Author:

Cerioli M.R.,Faria L.,Ferreira T.O.,Protti F.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference12 articles.

1. Approximation algorithms for NP-complete problems on planar graphs;Baker;Journal of the ACM,1994

2. H. Breu, “Algorithmic Aspects of Constrained Unit Disk Graphs”, PhD. Thesis, University of British Columbia, 1996

3. Unit disk graph recognition is NP-hard;Breu;Computational Geometry,1998

4. Unit disk graphs;Clark;Discrete Mathematics,1990

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

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Geometric Piercing Set Problem in Wireless Sensor Networks;Advanced Techniques for IoT Applications;2021-08-03

2. On the chromatic number of disjointness graphs of curves;Journal of Combinatorial Theory, Series B;2020-09

3. Approximation algorithms for maximum independent set of a unit disk graph;Information Processing Letters;2015-03

4. APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS;International Journal of Computational Geometry & Applications;2013-12

5. On the Most Likely Convex Hull of Uncertain Points;Lecture Notes in Computer Science;2013