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

Algorithmica (New York)

Volumn 43, Issue 1-2, 2005, Pages 5-15

  Goel, Ashish ^a   Estrin, Deborah ^b  

^a STANFORD UNIVERSITY   (United States)

^b Engineering IV   (United States)

Author keywords

Buy at bulk; Optimization

Indexed keywords

COSTS; FUNCTIONS; INFORMATION ANALYSIS; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

BUY-AT-BULK; CONCAVE COSTS; SENSOR NETWORKS; TREE CONSTRUCTION;

ALGORITHMS;

EID: 23944511730     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-005-1155-0     Document Type: Article

References (20)

1. N. Alon and J. Spencer. The Probabilistic Method (2nd ed.). Wiley, New York, 2000.
2. M. Andrews and L. Zhang. The access network design problem. Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, pages 40-49, 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-547, 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-187, 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. Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, pages 184-193, 1996.
7. Y. Bartal. On approximating arbitrary metrics by tree metrics. Proceedings of the 30th ACM Symposium on Theory of Computing, 1998.
8. C. Chekuri, S. Khanna, and S. Naor. A deterministic algorithm for the cost-distance problem. Proceedings of the 12th Annual Symposium on Discrete Algorithms, 2001.
9. D. Estrin, R. Govindan, and J. Heidemann (editors). Communications of the ACM (special issue on Embedding the Internet), 43(5), May 2000.
10. J. Fakcheroenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. Proceedings of the ACM Symposium on Theory of Computing, 2003.
11. S. Guha, A. Meyerson, and K. Munagala. Hierarchical placement and network design problems. Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, 2000.
12. S. Guha, A. Meyerson, and K. Munagala. A constant factor approximation for the single sink edge installation problem. Proceedings of the 33rd ACM Symposium on Theory of Computing, 2001.
13. A. Gupta, A. Kumar, M. Pal, and T. Roughgarden. Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem. Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, pages 606-615, 2003.
14. C. Intanagonwiwat, D. Estrin, R. Govindan, and J. Heidemann. Impact of network density on data aggregation in wireless sensor networks. Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS '02), pages 457-458, 2002.
15. C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion: a scalable and robust communication paradigm for sensor networks. ACM MobiCom, 2000.
16. S. Khuller, B. Raghavachari, and N. Young. Balancing minimum spanning and shortest path trees. Algorithmica, 14(4):305-321, 1994.
17. A. Meyerson, K. Munagala, and S. Plotkin. Cost-distance: two metric network design. Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pages 624-630, 2000.
18. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
19. P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer problems. Journal of Computer and System Sciences, 37:130-43, 1988.
20. K. Talwar. Single sink buy-at-bulk lp has constant integrality gap. Integer Programming and Combinatorial Optimization, 2002