Online algorithms for network design

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn 16, Issue , 2004, Pages 275-280

  Meyerson, Adam ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithms; Design; Theory

Indexed keywords

ALGORITHMS; COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; ELECTRIC NETWORK TOPOLOGY; ONLINE SYSTEMS; PROBLEM SOLVING; ROUTERS; TREES (MATHEMATICS);

NETWORK DESIGN; ONLINE ALGORITHMS;

COMPUTER NETWORKS;

EID: 8344255675     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007958     Document Type: Conference Paper

References (41)

1. N. Alon and Y. Azar. On-line steiner trees in the euclidean plane. Discrete and Computational Geometry, 10(2):113-121, 1993.
2. M. Andrews and L. Zhang. The access network design problem. IEEE Symposium on Foundations of Computer Science, pages 40-49, 1998.
3. V. Arya, N. Garg, R. Khandekar, V. Pandit, A. Meyerson, and K. Munagala. Local search heuristics for k-median and facility location problems. Proceedings of the 33rd ACM Symposium on Theory of Computing, 2001.
4. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line load balancing with applications to machine scheduling and virtual circuit routing. 25th ACM Symposium on Theory of Computing, pages 623-31, 1993.
5. 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.
6. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput competitive online routing. 34th IEEE symposium on Foundations of Computer Science, pages 32-40, 1993.
7. M. Balinski. Fixed cost transportation problems. Nav. Res. Log. Quarterly, 8:41-54, 1961.
8. P. Berman and C. Coulston. On-line algorithms for steiner tree problems. Proceedings of the 29th ACM STOC, 1997.
9. D. Bienstock, S. Chopra, O. Gunluk, and C-Y. Tsai. Minimum cost capacity installation for multicommodity flow networks. Mathematical Programming, 81:177-199, 1998.
10. D. Bienstock and O. Gunluk. Capacitated network design. INFORMS Journal on Computing, 8:243-259, 1996.
11. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1996.
12. C. Chekuri, S. Khanna, and S. Naor. A deterministic algorithm for the cost-distance problem. Symposium on Discrete Algorithms, 2001.
13. P.A. Chudak. Improved algorithms for uncapacitated facility location problem. Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization, 1998.
14. F.A. Chudak and D. B. Shmoys. Improved approximation algorithms for capacitated facility location problem. Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, 1999.
15. F.A. Chudak and D.P. Williamson. Improved approximation algorithms for capacitated facility location problems. Proceedings of the 7th Conference on Integer Programming and Combinatorial Optimization, 1999.
16. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. ACM Symposium on Theory of Computing, 2003.
17. P. Gray. Exact solution of the fixed charge transportation problem. Operations Research, 19:1529-1538, 1971.
18. S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, 1998.
19. S. Guha, A. Meyerson, and K. Munagala. Hierarchical placement and network design problems. IEEE Symposium on Foundations of Computer Science, 2000.
20. S. Guha, A. Meyerson, and K. Munagala. Improved combinatorial algorithms for single sink edge installation problems. ACM Symposium on Theory of Computing, 2001.
21. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams. Proceedings of the 41st Symposium on Foundations of Computer Science, 2000.
22. A. Gupta, A. Kumar, and T. Roughgarden. A constant-factor approximation algorithm for the multicommodity rent-or-buy problem. IEEE Symposium on Foundations of Computer Science, 2002.
23. A. Gupta, A. Kumar, and T. Roughgarden. Simpler and better approximation algorithms for network design. ACM Symposium on Theory of Computing, 2003.
24. M. Imaze and B. Waxman. Dynamic steiner tree problem. SIAM J. Discrete Math., 4(3):369-384, August 1991.
25. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. ACM Symposium on Theory of Computer Science, 2002.
26. M. Korupolu, C. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, 1998.
27. M. Korupolu, G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. Proceedings of 10th ACM-SIAM SODA, 1999.
28. A. Kuehn and M. Hamburger. A heuristic program for locating warehouses. Management Science, 9:643-666, 1963.
29. B. Li, M. Golin, G. Italiano, X. Deng, and K. Sohraby. On the optimal placement of web proxies in the internet. Proceedings of INFOCOM, 1999.
30. M. Mahdian, Y. Ye, and J. Zhang. Improved approximation algorithms for metric facility location problems. APPROX, 2002.
31. A. Manne. Plant location under economies-of-scale-decentralization and computation. Management Science, 11:213-235, 1964.
32. M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III. Bicriteria network design problems. Computing Research Repository: Computational Complexity, 1998.
33. R.R. Mettu and G.G. Plaxton. The online median problem. IEEE Symposium on Foundations of Computer Science, 2000.
34. A. Meyerson. Online facility location. IEEE Symposium on Foundations of Computer Science, 2001.
35. A. Meyerson, K. Munagala, and S. Plotkin. Cost-distance: Two metric network design. IEEE Symposium on Foundations of Computer Science, 2000.
36. A. Meyerson, K. Munagala, and S. Plotkin. Designing networks incrementally. IEEE Symposium on Foundations of Computer Science, 2001.
37. L. O'Callaghan, N. Mishra, A. Meyerson, S. Guha, and R. Motwani. Streaming data for high-quality clustering. IEEE Conference on Data Engineering, 2002.
38. M. Pal, É Tardos, and T. Wexler. Facility location with nonuniform hard capacities. Proceedings of the 42nd IEEE Symposium on the Foundations of Computer Science, 2001.
39. G. Robins and A. Zelikovsky. Improved steiner tree approximation in graphs. Proceedings of the 10th ACM-SIAM SODA, 2000.
40. F. S. Salman, J. Cheriyan, R. Ravi, and S. Subramanian. Buy-at-bulk network design: Approximating the single-sink edge installation problem. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 619-628, 1997.
41. W. Zangwill. Minimum concave cost flows in certain networks. Management Science, 14:429-450, 1968.