Balancing minimum spanning trees and shortest-path trees

This publication has 16 references indexed in Scilit:

• Provably good algorithms for performance-driven global routing
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• On sparse spanners of weighted graphs
  Discrete & Computational Geometry, 1993
• New sparseness results on graph spanners
  Published by Association for Computing Machinery (ACM) ,1992
• There are planar graphs almost as good as the complete graph
  Journal of Computer and System Sciences, 1989
• Fibonacci heaps and their uses in improved network optimization algorithms
  Journal of the ACM, 1987
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
  Combinatorica, 1986
• Computational Geometry
  Published by Springer Nature ,1985
• Routing to Multiple Destinations in Computer Networks
  IEEE Transactions on Communications, 1983
• A note on two problems in connexion with graphs
  Numerische Mathematik, 1959
• Shortest Connection Networks And Some Generalizations
  Bell System Technical Journal, 1957