NP-Completeness Results for Minimum Planar Spanners
暂无分享,去创建一个
[1] Guy Kortsarz. On the Hardness of Approximation Spanners , 1998, APPROX.
[2] Guy Kortsarz,et al. Generating Sparse 2-Spanners , 1992, J. Algorithms.
[3] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[4] Leizhen Cai,et al. Tree Spanners , 1995, SIAM J. Discret. Math..
[5] Anthony Mansfield,et al. Determining the thickness of graphs is NP-hard , 1983, Mathematical Proceedings of the Cambridge Philosophical Society.
[6] Rajeev Motwani,et al. Towards a syntactic characterization of PTAS , 1996, STOC '96.
[7] Leizhen Cai,et al. NP-Completeness of Minimum Spanner Problems , 1994, Discret. Appl. Math..
[8] Jose Augusto Ramos Soares,et al. Graph Spanners: a Survey , 1992 .
[9] Arthur L. Liestman,et al. Additive graph spanners , 1993, Networks.
[10] C. Pandu Rangan,et al. Restrictions of Minimum Spanner Problems , 1997, Inf. Comput..
[11] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..
[12] S. S. Yau,et al. Distance matrix of a graph and its realizability , 1965 .
[13] S. Gopalacharyulu. BIHARMONIC EIGENFUNCTION EXPANSIONS FOR THE SECTOR PROBLEM , 1969 .
[14] Arthur L. Liestman,et al. Grid spanners , 1993, Networks.
[15] David Peleg,et al. An optimal synchronizer for the hypercube , 1987, PODC '87.
[16] David P. Dobkin,et al. On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..
[17] J. Soares. Graph Spanners: a Survey , 1992 .
[18] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.