Balancing Minimum Spanning and Shortest Path Trees (1993)

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

Documents Related by Co-Citation

11502 Computers and Intractability, A Guide to the Theory of NPCompleteness – M R Garey, D S Johnson - 1979
63 Cost-Sensitive Analysis of Communication Protocols – B Awerbuch, A Baratz, D Peleg - 1990
358 A general approximation technique for constrained forest problems – Michel X. Goemans, David P. Williamson - 1995
326 Probabilistic Approximation of Metric Spaces and its Algorithmic Applications – Yair Bartal - 1996
577 Shortest connection networks and some generalizations – R C Prim
1457 Energy-efficient communication protocol for wireless microsensor networks – Wendi Rabiner Heinzelman, Anantha Chandrakasan, Hari Balakrishnan - 2000
256 On Approximating Arbitrary Metrics by Tree Metrics – Yair Bartal - 1998
1981 Directed Diffusion: A scalable and robust communication paradigm for sensor networks – Chalermek Intanagonwiwat, Ramesh Govindan, Deborah Estrin - 2000
658 A Threshold of ln n for Approximating Set Cover – Uriel Feige - 1998