A distance approximating trees

A 1-approximation of connected graph G=(V,E) is a tree T=(V,E^') with the same vertex set such that for every two vertices |d"G(u,v)-d"T(u,v)|=<1. A polynomial time algorithm is designed for finding such a tree.

[1]  Frank Harary,et al.  Graph Theory , 2016 .

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

[3]  Dagmar Handke,et al.  NP-Completeness Results for Minimum Planar Spanners , 1998, Discret. Math. Theor. Comput. Sci..

[4]  Arthur L. Liestman,et al.  Additive graph spanners , 1993, Networks.

[5]  Feodor F. Dragan,et al.  Distance Approximating Trees: Complexity and Algorithms , 2006, CIAC.

[6]  Erich Prisner.  Distance Approximating Spanning Trees , 1997, STACS.

[7]  Feodor F. Dragan,et al.  A Note on Distance Approximating Trees in Graphs , 2000, Eur. J. Comb..

[8]  Feodor F. Dragan,et al.  Distance Approximating Trees for Chordal and Dually Chordal Graphs , 1999, J. Algorithms.