Computing A Diameter-Constrained Minimum Spanning Tree (2001)


Download Links

by Ayman Mahmoud Abdalla
Citations:8 - 0 self

Active Bibliography

9 Random-Tree Diameter and the DiameterConstrained MST – Ayman Abdalla, Narsingh Deo, Pankaj Gupta - 2000
Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instances – Martin Gruber, Günther R. Raidl
(Meta-)Heuristic Separation of Jump Cuts for the Bounded Diameter Minimum Spanning Tree Problem – Martin Gruber, Günther R. Raidl
35 Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem – Günther R. Raidl, B. Julstrom - 2003
14 Variable neighborhood search for the bounded diameter minimum spanning tree problem – Martin Gruber, Günther R. Raidl - 2005
4 Neighbourhood Searches for the Bounded Diameter . . . – Martin Gruber, Jano van Hemert, Günther R. Raidl - 2006
Design of Ovelay Networks for Internet Multicast (References) – Sherlia Shi, D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, R. Morris, Resilient Overlay, B. Cain, S. Deering, B. Fenner, I. Kouvelas, A. Thyagarajan, Internet Group - 2002
2 Approximating the Geometric Minimum-Diameter Spanning Tree – Joachim Gudmundsson, Herman Haverkort, Sang-min Park, Chan-Su Shin, Alexander Wolff, Ernst-moritz-arndt-universitat Greifswald - 2002
5 Facility Location and the Geometric Minimum-Diameter Spanning Tree – Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff - 2003
19 Multicast Routing and Bandwidth Dimensioning in Overlay Networks – Sherlia Shi, Jonathan S. Turner - 2002
7 Minimum Restricted Diameter Spanning Trees – Refael Hassin, Asaf Levin - 2003
54 Dimensioning server access bandwidth and multicast routing in overlay networks – Sherlia Y. Shi, Jonathan S. Turner, Marcel Waldvogel - 2001
Approximating Network Design Problems on Directed and Undirected Graphs – n.n.
One choosing clients and centers with service cost and on Network Design Problems, with hard capacities – n.n.
28 Approximating the Weight of Shallow Steiner Trees – Guy Kortsarz, David Peleg - 1998
139 Spanning Trees and Spanners – David Eppstein - 1996
14 Random Sampling in Matroids, with Applications to Graph Connectivity and Minimum Spanning Trees – David R. Karger - 1993
On the bounded-hop MST problem on . . . – Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri - 2006
506 How bad is selfish routing? – Tim Roughgarden, Éva Tardos - 2002