Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 499-505

  Goel, Ashish ^a   Estrin, Deborah ^b  

^a University of Southern California   (United States)

^b Los Angeles   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; FUNCTIONS; OPTIMIZATION; THEOREM PROVING; TREES (MATHEMATICS);

DERANDOMIZATION; HIERARCHICAL MATCHING ALGORITHM; TREE CONSTRUCTION ALGORITHM;

ALGORITHMS;

EID: 0037739959     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. N. Alon and J. Spencer. The Probabilistic Method (2nd Ed.). Wiley, 2000.
2. M. Andrews and L. Zhang. The access network design problem. Proceedings of 39th IEEE Symposium on Foundations of Computer Science, 1998.
3. B. Awerbuch and Y. Azar. Buy-at-bulk network design. Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pages 542-47, 1997.
4. B. Awerbuch, A. Baratz, and D. Peleg. Cost-sensitive analysis of communication protocols. Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, pages 177-87, 1990.
5. B. Awerbuch, A. Baratz, and D. Peleg. Efficient broadcast and light-weight spanners. Manuscript, 1991.
6. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. 37th IEEE symposium on Foundations of Computer Science, pages 184-193, 1996.
7. Y. Bartal. On approximating arbitrary metrics by tree metrics. 30th ACM Symposium on Theory of Computing, 1998.
8. C. Chekuri, S. Khanna, and S. Naor. A deterministic algorithm for the cost-distance problem. Proc. 12th Annual Symposium on Discrete Algorithms, 2001.
9. D. Estrin, R. Govindan, and J. Heidemann (Editors). Embedding the internet. CACM special issue on embedding the Internet, 43(5), May 2000.
10. S. Guha, K. Munagala, and A. Meyerson. Hierarchical placement and network design problems. Proceedings of 41st IEEE Symposium on Foundations of Computer Science, 2000.
11. S. Guha, K. Munagala, and A. Meyerson. A constant factor approximation for the single sink edge installation problem. Proceedings of 33rd ACM Symposium on Theory of Computing, 2001.
12. C. Intanagonwiwat, D. Estrin, R. Govindan, and J. Heidemann. Impact of network density on data aggregation in wireless sensor networks. To appear in Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS'02), 2002.
13. C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion: A scalable and robust communication paradigm for sensor networks. ACM MobiCom, 2000.
14. S. Khuller, B. Raghavachari, and N. Young. Balancing minimum spanning and shortest path trees. Algorithmica, 14(4):305-321, 1994.
15. A. Meyerson, K. Munagala, and S. Plotkin. Cost-distance: Two metric network design. Proc. of 41st IEEE Symposium on Foundations of Computer Science, 2000.
16. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
17. P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer problems. Journal of Comp. Sys. Sci., 37:130-43, 1988.