Balancing Minimum Spanning and Shortest Path Trees (1993)

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

Documents Related by Co-Citation

11073 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
61 Cost-sensitive analysis of communication protocols – B Awerbuch, A Baratz, D Peleg - 1990
353 A general approximation technique for constrained forest problems – Michel X. Goemans, David P. Williamson - 1995
1351 Energy-efficient communication protocol for wireless microsensor networks – Wendi Rabiner Heinzelman, Anantha Ch, Hari Balakrishnan - 2000
549 Shortest connection networks and some generalizations – R C Prim - 1957
316 Probabilistic Approximation of Metric Spaces and its Algorithmic Applications – Yair Bartal - 1996
1111 A Case for End System Multicast – Yang-hua Chu, Sanjay G. Rao, Srinivasan Seshan, Hui Zhang - 2000
1849 Directed Diffusion: A scalable and robust communication paradigm for sensor networks – Chalermek Intanagonwiwat, Ramesh Govindan, Deborah Estrin - 2000
637 A Threshold of ln n for Approximating Set Cover – Uriel Feige - 1998