Article

Online algorithms for network design

Author:

Adam MeyersonAuthors Info & Claims

SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures

Pages 275 - 280

https://doi.org/10.1145/1007912.1007958

Published: 27 June 2004 Publication History

Abstract

This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer networks (wired and wireless) as well as many other applications. In most cases the natural applications involve changing sets of communicating nodes, making the online model essential for addressing them.

References

[1]

N. Alon and Y. Azar. On-line steiner trees in the euclidean plane. Discrete and Computational Geometry, 10(2):113--121, 1993.]]

Digital Library

[2]

M. Andrews and L. Zhang. The access network design problem. IEEE Symposium on Foundations of Computer Science, pages 40--49, 1998.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[9]

D. Bienstock, S. Chopra, O. Gunluk, and C-Y. Tsai. Minimum cost capacity installation for multicommodity ow networks. Mathematical Programming, 81:177--199, 1998.]]

Digital Library

[10]

D. Bienstock and O. Gunluk. Capacitated network design. INFORMS Journal on Computing, 8:243--259, 1996.]]

Digital Library

[11]

A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1996.]]

Digital Library

[12]

C. Chekuri, S. Khanna, and S. Naor. A deterministic algorithm for the cost-distance problem. Symposium on Discrete Algorithms, 2001.]]

Digital Library

[13]

F.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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[19]

S. Guha, A. Meyerson, and K. Munagala. Hierarchical placement and network design problems. IEEE Symposium on Foundations of Computer Science, 2000.]]

Digital Library

[20]

S. Guha, A. Meyerson, and K. Munagala. Improved combinatorial algorithms for single sink edge installation problems. ACM Symposium on Theory of Computing, 2001.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[23]

A. Gupta, A. Kumar, and T. Roughgarden. Simpler and better approximation algorithms for network design. ACM Symposium on Theory of Computing, 2003.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[27]

M. Korupolu, G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. Proceedings of 10th ACM-SIAM SODA, 1999.]]

Digital Library

[28]

A. Kuehn and M. Hamburger. A heuristic program for locating warehouses. Management Science, 9:643--666, 1963.]]

Digital Library

[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.]]

Digital Library

[31]

A. Manne. Plant location under economies-of-scale-decentralization and computation. Management Science, 11:213--235, 1964.]]

Digital Library

[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.]]

Digital Library

[33]

R.R. Mettu and C.G. Plaxton. The online median problem. IEEE Symposium on Foundations of Computer Science, 2000.]]

Digital Library

[34]

A. Meyerson. Online facility location. IEEE Symposium on Foundations of Computer Science, 2001.]]

Digital Library

[35]

A. Meyerson, K. Munagala, and S. Plotkin. Cost-distance: Two metric network design. IEEE Symposium on Foundations of Computer Science, 2000.]]

Digital Library

[36]

A. Meyerson, K. Munagala, and S. Plotkin. Designing networks incrementally. IEEE Symposium on Foundations of Computer Science, 2001.]]

Digital Library

[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.]]

Digital Library

[38]

M. Pál, É Tardos, and T. Wexler. Facility location with nonuniform hard capacities. Proceedings of the 42nd IEEE Symposium on the Foundations of Computer Science, 2001.]]

Digital Library

[39]

G. Robins and A. Zelikovsky. Improved steiner tree approximation in graphs. Proceedings of the 10th ACM-SIAM SODA, 2000.]]

Digital Library

[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.]]

Digital Library

[41]

W. Zangwill. Minimum concave cost ows in certain networks. Management Science, 14:429--450, 1968.]]

Digital Library

Cited By

Andro-Vasko JBein WIto HKasahara SKawahara J(2021)Decrease and reset for power-downEnergy Systems10.1007/s12667-021-00475-314:2(445-471)Online publication date: 3-Sep-2021
https://doi.org/10.1007/s12667-021-00475-3
Garraffa MMehta DO’Sullivan BOzturk CQuesada L(2021)An adaptive large neighbourhood search algorithm for diameter bounded network design problemsJournal of Heuristics10.1007/s10732-021-09481-1Online publication date: 23-Jun-2021
https://doi.org/10.1007/s10732-021-09481-1
Shen XNagarajan V(2019)Online covering with $$\ell _q$$ ℓ q -norm objectives and applications to network designMathematical Programming10.1007/s10107-019-01409-9Online publication date: 18-Jun-2019
https://doi.org/10.1007/s10107-019-01409-9
Show More Cited By

Index Terms

Online algorithms for network design
1. Networks
  1. Network properties
    1. Network structure
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures

June 2004

332 pages

ISBN:1581138407

DOI:10.1145/1007912

General Chair:
Phil Gibbons
Intel Research
,
Program Chair:
Micah Adler
University of Massachusetts

Copyright © 2004 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 June 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA04

Sponsor:

SPAA04: 16th ACM Symposium on Parallelism in Algorithms and Architectures 2004

June 27 - 30, 2004

Barcelona, Spain

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
567
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)3

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Andro-Vasko JBein WIto HKasahara SKawahara J(2021)Decrease and reset for power-downEnergy Systems10.1007/s12667-021-00475-314:2(445-471)Online publication date: 3-Sep-2021
https://doi.org/10.1007/s12667-021-00475-3
Garraffa MMehta DO’Sullivan BOzturk CQuesada L(2021)An adaptive large neighbourhood search algorithm for diameter bounded network design problemsJournal of Heuristics10.1007/s10732-021-09481-1Online publication date: 23-Jun-2021
https://doi.org/10.1007/s10732-021-09481-1
Shen XNagarajan V(2019)Online covering with $$\ell _q$$ ℓ q -norm objectives and applications to network designMathematical Programming10.1007/s10107-019-01409-9Online publication date: 18-Jun-2019
https://doi.org/10.1007/s10107-019-01409-9
Chakrabarty DEne AKrishnaswamy RPanigrahi D(2018)Online Buy-at-Bulk Network DesignSIAM Journal on Computing10.1137/16M111731747:4(1505-1528)Online publication date: Jan-2018
https://doi.org/10.1137/16M1117317
Ene AChakrabarty DKrishnaswamy RPanigrahi D(2015)Online Buy-at-Bulk Network DesignProceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2015.40(545-562)Online publication date: 17-Oct-2015
https://dl.acm.org/doi/10.1109/FOCS.2015.40
Antonakopoulos S(2011)Approximating Directed Buy-at-Bulk Network DesignApproximation and Online Algorithms10.1007/978-3-642-18318-8_2(13-24)Online publication date: 2011
https://doi.org/10.1007/978-3-642-18318-8_2
Chuzhoy JGupta ANaor JSinha A(2008)On the approximability of some network design problemsACM Transactions on Algorithms10.1145/1361192.13612004:2(1-17)Online publication date: 29-May-2008
https://dl.acm.org/doi/10.1145/1361192.1361200
Gupta AHajiaghayi MKumar A(2007)Stochastic Steiner Tree with Non-uniform InflationProceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques10.1007/978-3-540-74208-1_10(134-148)Online publication date: 20-Aug-2007
https://dl.acm.org/doi/10.1007/978-3-540-74208-1_10
Chuzhoy JGupta ANaor JSinha A(2005)On the approximability of some network design problemsProceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms10.5555/1070432.1070568(943-951)Online publication date: 23-Jan-2005
https://dl.acm.org/doi/10.5555/1070432.1070568
Charikar MKaragiozova AGabow HFagin R(2005)On non-uniform multicommodity buy-at-bulk network designProceedings of the thirty-seventh annual ACM symposium on Theory of computing10.1145/1060590.1060617(176-182)Online publication date: 22-May-2005
https://dl.acm.org/doi/10.1145/1060590.1060617

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents