Balancing Minimum Spanning and Shortest Path Trees (1993)

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

Documents Related by Co-Citation

10958 D.S.: Computers and Intractibility: A Guide to the Theory of NP-Completeness – M R Garey, Johnson - 1979
60 Cost-sensitive analysis of communication protocols – A Baratz Awerbuch, D Peleg - 1990
349 A general approximation technique for constrained forest problems – Michel X. Goemans, David P. Williamson - 1995
532 Shortest connection networks and some generalizations – R C Prim - 1957
315 Probabilistic Approximation of Metric Spaces and its Algorithmic Applications – Yair Bartal - 1996
1101 A Case for End System Multicast – Yang-hua Chu, Sanjay G. Rao, Srinivasan Seshan, Hui Zhang - 2000
627 A Threshold of ln n for Approximating Set Cover – Uriel Feige - 1998
1149 A Survey on Sensor Networks – Lan F. Akyildiz, Welljan Su, Yogesh Sankarasubramaniam, Erdal Cayirci - 2002
876 Noiseless coding of correlated information sources – D Slepian, J K Wolf - 1973