An improved algorithm for the k -source maximum eccentricity spanning trees

Discrete Applied Mathematics

Volumn 143, Issue 1-3, 2004, Pages 342-350

  Wu, Bang Ye ^a  

^a SHU TE UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Network design; Optimization problems; Spanning trees

Indexed keywords

FUNCTIONS; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

NETWORK DESIGN; OPTIMIZATION PROBLEMS; SPANNING TREES;

ALGORITHMS;

EID: 4243103716     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.12.004     Document Type: Article

References (16)

1. Connamacher H.S., Proskurowski A. The complexity of minimizing certain cost metrics for. k -source spanning trees Discrete Appl. Math. 131:2003;113-127.
2. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1994;MIT Press, Cambridge, MA.
3. Dijkstra E.W. A note on two problems in connexion with graphs. Numer. Math. 1:1959;269-271.
4. Farley A.M., Fragopoulou P., Krumme D.W., Proskurowski A., Richards D. Multi-source spanning tree problems. J. Interconnect. Networks. 1:2000;61-71.
5. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;W.H. Freeman and Company, San Francisco.
6. Hu T.C. Optimum communication spanning trees. SIAM J. Comput. 3:1974;188-195.
7. Johnson D.S., Lenstra J.K., Rinnooy Kan A.H.G. The complexity of the network design problem. Networks. 8:1978;279-285.
8. Krumme D.W., Fragopoulou P. Minimum eccentricity multicast trees. Discrete Math. Theoret. Comput. Sci. 4:2001;157-172.
9. McMahan H.B., Proskurowski A. Multi-source spanning trees: algorithms for minimizing source eccentricities. Discrete Appl. Math. 137:2004;213-222.
10. Thorup M. Undirected single source shortest paths with positive integer weights in linear time. J. ACM. 46:1999;362-394.
11. Wu B.Y. A polynomial time approximation scheme for the two-source minimum routing cost spanning trees. J. Algorithm. 44:2002;359-378.
12. B.Y. Wu, Approximation algorithms for the optimal p -source communication spanning tree, Discrete Appl. Math., to appear.
13. Wu B.Y., Chao K.-M., Tang C.Y. Approximation algorithms for the shortest total path length spanning tree problem. Discrete Appl. Math. 105:2000;273-289.
14. Wu B.Y., Chao K.-M., Tang C.Y. Approximation algorithms for some optimum communication spanning tree problems. Discrete Appl. Math. 102:2000;245-266.
15. Wu B.Y., Chao K.-M., Tang C.Y. A polynomial time approximation scheme for optimal product-requirement communication spanning trees. J. Algorithm. 36:2000;182-204.
16. Wu B.Y., Lancia G., Bafna V., Chao K.-M., Ravi R., Tang C.Y. A polynomial time approximation scheme for minimum routing cost spanning trees. SIAM J. Comput. 29:2000;761-778.