Balancing Minimum Spanning and Shortest Path Trees (1993)

by Samir Khuller , Balaji Raghavachari , Neal Young
Citations:62 - 1 self

Active Bibliography

39 Balancing Minimum Spanning Trees and Shortest-Path Trees – Samir Khuller, Balaji Raghavachari, Neal Young - 2002
31 Prim-Dijkstra Tradeoffs for Improved Performance-Driven Routing Tree Design – C. J. Alpert, T. C. Hu, J. H. Huang, A. B. Kahng, D. Karger - 1995
1 Narrow-Shallow-Low-Light Trees with and without Steiner Points – Michael Elkin, Shay Solomon
7 Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners – Yefim Dinitz, Michael Elkin, Shay Solomon
38 High-Performance Routing Trees With Identified Critical Sinks – Kenneth D. Boese, Andrew B. Kahng, Gabriel Robins - 1992
103 Performance optimization of VLSI interconnect layout – Jason Cong, Lei He, Cheng-kok Koh, Patrick H. Madden - 1996
10 Generating Low-Degree 2-Spanners – Guy Kortsarz, David Peleg - 1993
1 Fast constructions of light-weight spanners for general graphs – Michael Elkin, Shay Solomon - 2013
22 An Approximation Algorithm for Minimum-Cost Network Design – Yishay Mansour, David Peleg - 1998
25 A Direct Combination of the Prim and Dijkstra Constructions for Improved Performance-Driven Global Routing – C. J. Alpert, T. C. Hu, J. H. Huang, A. B. Kahng - 1993
51 Near-Optimal Critical Sink Routing Tree Constructions – Kenneth D. Boese, Andrew B. Kahng, Bernard A. McCoy , Gabriel Robins - 1995
58 Tree spanners – Leizhen Cai, Derek Corneil - 1995
1 Constructing the Spanners of Graphs in Parallel – Weifa Liang, Richard P. Brent - 1996
20 Near-Linear Cost Sequential and Distributed Constructions of Sparse Neighborhood Covers – Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg - 1993
43 Near-linear time construction of sparse neighborhood covers – Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg - 1998
17 Timing-Driven Routing for Symmetrical-Array-Based FPGAs – Kai Zhu, Yao-wen Chang, D. F. Wong - 2000
1 Design and Analysis of Algorithms: Course Notes – Samir Khuller
36 All-Pairs Small-Stretch Paths – Edith Cohen, Uri Zwick - 1997
13 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002