论文信息 - NP-Completeness of Minimum Spanner Problems - 字舞流文

NP-Completeness of Minimum Spanner Problems

Leizhen Cai | L. Cai

[1] Leizhen Cai,et al. Tree Spanners , 1995, SIAM J. Discret. Math..

[2] Leizhen Cai,et al. Spanners in graphs of bounded degree , 1994, Networks.

[3] David P. Dobkin,et al. On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..

[4] J. Soares. Graph Spanners: a Survey , 1992 .

[5] Guy Kortsarz,et al. Generating Sparse 2-Spanners , 1992, J. Algorithms.

[6] Jose Augusto Ramos Soares,et al. Graph Spanners: a Survey , 1992 .

[7] L. Cai. Tree spanners: spanning trees that approximate distances , 1992 .

[8] Detlef Seese,et al. Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[9] Eli Upfal,et al. A tradeoff between space and efficiency for routing tables , 1988, STOC '88.

[10] David Peleg,et al. An optimal synchronizer for the hypercube , 1987, PODC '87.

[11] David P. Dobkin,et al. Delaunay graphs are almost as good as complete graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[12] A. Dress,et al. Reconstructing the shape of a tree from observed dissimilarity data , 1986 .

[13] Paul Chew,et al. There is a planar graph almost as good as the complete graph , 1986, SCG '86.

[14] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .