Article

Free access

Buy-at-bulk network design: approximating the single-sink edge installation problem

Authors:

F. S. Salman,

J. Cheriyan,

R. Ravi,

S. SubramanianAuthors Info & Claims

SODA '97: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

Pages 619 - 628

Published: 05 January 1997 Publication History

PDF eReader

References

[1]

I. AlthSfer, G. Das, D. Dobkin, D. Joseph and J. Soares, "On sparse spanners of weighted graphs," Discrete and Computational Geometry, 9, No. 1, 81- 100, 1993.

Digital Library

Google Scholar

[2]

A. Agrawal, P. Klein and R. Ravi, "When trees collide: An approximation algorithm for the generalized Steiner problem on networks," SIAM J. Computing 24, 1995.

Digital Library

Google Scholar

[3]

A. Balakrishnan, T. Magnanti and R. T. Wong, "A decomposition algorithm for local access telecommunications network expansion planning," Operations Research, 43, 58-76, 1995.

Google Scholar

[4]

M. L. BaJinski, "Fixed cost transportation problems,'' Nay. Res. Log. Quart. 8, 41-54, 1961.

Google Scholar

[5]

D. Bienstock, S. Chopra, O. Gunluk and C- Y. Tsai, "Minimum cost capacity installation for multicommodity network flows,", manuscript, July 1995.

Google Scholar

[6]

D. Bienstock and O. Gunluk, "Capacitated network design- Polyhedral structure and computation," To appear, ORSA J. of Comput.

Google Scholar

[7]

V. Chv~tal, "A greedy heuristic for the set-covering problem," Mathematics of Operations Research, 4, 233-235, 1979.

Google Scholar

[8]

T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, The MIT Press, Caanbridge, MA, 1990.

Digital Library

Google Scholar

[9]

P. C. Gilmore and R. E. Gomory, "Multi-stage cutting stock problems of two and more dimensions," Operations Research, 13, 94-120, 1965.

Google Scholar

[10]

G. V. Gens and E. V. Levner, "Computational complexity of approximation algorithms for combinatorial problems," Lecture Notes in Computer Science, 74, 292-300, 1979.

Google Scholar

[11]

G. Gallo, C. Sandi and C. Sodini, "An algorithm for the rain concave cost flow problem," Eur. J. Opnl. Res. 4, 248-255, 1980.

Google Scholar

[12]

M. R. Garey and D. S. Johnson, Computers and IntractabilitY: A Guide to the Theory o.f NP- Completeness, W. H. Freeman, San Francisco, 1979.

Digital Library

Google Scholar

[13]

M. X. Goemans and D. P. Williamson, "A general approximation technique for constrained forest problems,'' SIAM j. Computing, 24, 1995.

Digital Library

Google Scholar

[14]

M. Goldstein and B. Rothfarb, "The one terminal telepak problem," Operations Research, 19, 156-169, 1971.

Google Scholar

[15]

P. Gray, "Exact solution of the fixed charge transportation problem," Operations Research 19, 1529- 1538, 1971.

Google Scholar

[16]

S. Khulter, B. Raghavachari and N. E. Young, "Balancing minimum spanning and shortest path trees," Algorithmica 14 (1995), 305-322.

Google Scholar

[17]

G. S. Lueker, "Two NP-complete problems in nonnegative integer programming," Report No. 178, Computer Science Laboratory, Princeton University, Princeton, N J, 1995.

Google Scholar

[18]

T. L. Magnanti, P. Mirchandani and R. Vachani, "Modeling and solving the two-facility capacitated network loading problem," Operations Research, 43, 142-157, 1995.

Google Scholar

[19]

Y. Mansour and D. Peleg, "An approximation algorithm for minimum-cost network design," The Weizman Institute of Science, Rehovot, 76100 Israel, Tech. Report CS94-22, 10 pages, 1994.

Digital Library

Google Scholar

[20]

S. Martello and P. Toth, Knapsack problems: algorithms and computer implementations, John Wiley & Sons, England, 1990.

Digital Library

Google Scholar

[21]

M. Minoux, "Network synthesis and optimum network design problems: Models, solution methods and applications," Networks, 19, 313-360, 1989.

Google Scholar

[22]

D. P. Williamson, M. X. Goemans, M. Mihail and V. V. Vazira~i, "A primaJ-dual approximation algorithm for generalized Steiner network problems," Combinatorica, 15, 1995.

Google Scholar

[23]

B. ~u and J. Cheriyan, "Approximation algorithms for feasible cut and multicut problems", Proc. Algorithms- ESA'95, 3rd Annual European Symposium, P. $pira~is (Ed.), LNCS 979, Springer, New York, 394- 408, 1995.

Digital Library

Google Scholar

[24]

W. I. Zaugwill, "Minimum concave cost flows in certain networks," Mgmt. Sci., 14, 429-450, 1968.

Google Scholar

Cited By

View all

Li SMarkarian CMeyer Auf Der Heide F(2018)Towards Flexible Demands in Online Leasing ProblemsAlgorithmica10.1007/s00453-018-0420-y80:5(1556-1574)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1007/s00453-018-0420-y
Gupta ARavi RTalwar KUmboh SKlein P(2017)LAST but not leastProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039724(589-599)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039724
Parter MPeleg DBlelloch GAgrawal K(2015)Fault Tolerant BFS StructuresProceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures10.1145/2755573.2755590(264-273)Online publication date: 13-Jun-2015
https://dl.acm.org/doi/10.1145/2755573.2755590
Show More Cited By

Index Terms

Buy-at-bulk network design: approximating the single-sink edge installation problem
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
FOCS '06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science

We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Karagiozova (STOC' 05); for an instance on h pairs their algorithm has an ...
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design
SPAA '12: Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures

This paper presents parallel algorithms for embedding an arbitrary n-point metric space into a distribution of dominating trees with O(log n) expected stretch. Such embedding has proved useful in the design of many approximation algorithms in the ...
Online Buy-at-Bulk Network Design

We present the first online algorithms for the nonuniform, multicommodity buy-at-bulk (MC-BB) network design problem. Our competitive ratios qualitatively match the best known approximation factors for the corresponding offline problems. In particular, we ...

Comments

Information & Contributors

Information

Published In

SODA '97: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

January 1997

788 pages

ISBN:0898713900

Chairman:
Michael Saks

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 05 January 1997

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
520
Total Downloads

Downloads (Last 12 months)42
Downloads (Last 6 weeks)14

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li SMarkarian CMeyer Auf Der Heide F(2018)Towards Flexible Demands in Online Leasing ProblemsAlgorithmica10.1007/s00453-018-0420-y80:5(1556-1574)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1007/s00453-018-0420-y
Gupta ARavi RTalwar KUmboh SKlein P(2017)LAST but not leastProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039724(589-599)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039724
Parter MPeleg DBlelloch GAgrawal K(2015)Fault Tolerant BFS StructuresProceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures10.1145/2755573.2755590(264-273)Online publication date: 13-Jun-2015
https://dl.acm.org/doi/10.1145/2755573.2755590
Solomon SCheng SDevillers O(2014)Euclidean Steiner Shallow-Light TreesProceedings of the thirtieth annual symposium on Computational geometry10.1145/2582112.2582160(454-463)Online publication date: 8-Jun-2014
https://dl.acm.org/doi/10.1145/2582112.2582160
Zhang P(2014)A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network designJournal of Combinatorial Optimization10.1007/s10878-012-9544-127:4(663-678)Online publication date: 1-May-2014
https://dl.acm.org/doi/10.1007/s10878-012-9544-1
Jothi RRaghavachari B(2005)Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network designACM Transactions on Algorithms10.1145/1103963.11039671:2(265-282)Online publication date: 1-Oct-2005
https://dl.acm.org/doi/10.1145/1103963.1103967
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
Meyerson AGibbons PAdler M(2004)Online algorithms for network designProceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures10.1145/1007912.1007958(275-280)Online publication date: 27-Jun-2004
https://dl.acm.org/doi/10.1145/1007912.1007958
Alderson DDoyle JGovindan RWillinger W(2003)Toward an optimization-driven framework for designing and generating realistic Internet topologiesACM SIGCOMM Computer Communication Review10.1145/774763.77476933:1(41-46)Online publication date: 1-Jan-2003
https://dl.acm.org/doi/10.1145/774763.774769
Gupta AKleinberg JKumar ARastogi RYener BVitter JSpirakis PYannakakis M(2001)Provisioning a virtual private networkProceedings of the thirty-third annual ACM symposium on Theory of computing10.1145/380752.380830(389-398)Online publication date: 6-Jul-2001
https://dl.acm.org/doi/10.1145/380752.380830
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design

Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design

Online Buy-at-Bulk Network Design

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design

Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design

Online Buy-at-Bulk Network Design

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations