NP-completeness results for minimum planar spanners

Discrete Mathematics and Theoretical Computer Science

Volumn 3, Issue 1, 1998, Pages 1-10

  Brandes, Ulrik ^a   Handke, Dagmar ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

Graph spanners; NP completeness; Planar graphs

Indexed keywords

EID: 33744957296     PISSN: 13658050     EISSN: 13658050     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, and José Soares. On sparse spanners of weighted graphs. Discrete Comput Geom., 9:81-100, 1993.
2. Leizhen Cai. NP-completeness of minimum spanner problems. Discrete Applied Math., 48:187-194, 1994.
3. Leizhen Cai and D.G. Corneil. Tree spanners. SIAM J. Discrete Math., 8(3):359-387, 1995.
4. S.L. Hakimi and S.-T. Yau. Distance matrix of a graph and its realizability. Q. J. Mech. appl. Math., 22:305-317, 1964.
5. Guy Kortsarz. On the hardness of approximating spanners. to appear at APPROX'98, 1998.
6. Sanjeev Khanna and Rajeev Motwani. Towards a syntactic characterization of PTAS. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC'96, pages 329-337, 1996.
7. Guy Kortsarz and David Peleg. Generating sparse 2-spanners. In Proceedings 3rd Scandinavian Workshop on Algorithm Theory, SWAT'92, pages 301-309, 1992.
8. A.L. Liestman and Thomas Shermer. Grid spanners. Networks, 23:123-133, 1993.
9. Anthony Mansfield. Determining the thickness of graphs is NP-hard. Math. Proc. Camb. Phil. Soc., 93:9-23, 1983.
10. Christos H. Papadimitriou and Mihalis Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991.
11. David Peleg and Alejandro A. Schäffer. Graph spanners. J. of Graph Theory, 13:99-116, 1989.
12. David Peleg and Jeffrey D. Ullman. An optimal synchronizer for the hypercube. In Proceedings 1987 6th ACMSymposium on Principles of Dist. Comp., Vancouver, pages 77-85, 1987.
13. José Soares. Graph spanners: a survey. Congressus Numerantium, 89:225-238, 1992.
14. G. Venkatesan, Udi Rotics, M.S. Madanlal, Johann A. Makowsky, and C. P̃andu Rangan. Restrictions of minimum spanner problems. Information and Computation, 136(2):143-164, August 1997.