Article

Hardness of Buy-at-Bulk Network Design

Author:

Matthew AndrewsAuthors Info & Claims

FOCS '04: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science

Pages 115 - 124

https://doi.org/10.1109/FOCS.2004.32

Published: 17 October 2004 Publication History

Publisher Site

Abstract

We consider the Buy-at-Bulk network design problem in which we wish to design a network for carrying multicommodity demands from a set of source nodes to a set of destination nodes. The key feature of the problem is that the cost of capacity on each edge is concave and hence exhibits economies of scale. If the cost of capacity per unit length can be different on different edges then we say that the problem is non-uniform. The problem is uniform otherwise. We show that for any constant, if NP ZIPTIME(n^polylog n) then there is no 0(\log ^{\frac{1}{2} - \gamma } N)-approximation algorithm for non-uniform Buy-at-Bulk network design and there is no 0(\log ^{\frac{1}{4} - \gamma } N)-approximation algorithm for the uniform problem.

Cited By

View all

Zhang YZhang HCong PWang W(2024)ROND: Rethinking Overlay Network Design with Underlay Network AwarenessProceedings of the ACM on Networking10.1145/36562982:CoNEXT2(1-22)Online publication date: 13-Jun-2024
https://dl.acm.org/doi/10.1145/3656298
Emek YKutten SLavi RShi Y(2020)Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy EfficiencyJournal of the ACM10.1145/337738767:1(1-33)Online publication date: 7-Feb-2020
https://dl.acm.org/doi/10.1145/3377387
Friedrichs SLenzen C(2018)Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-FordJournal of the ACM10.1145/323159165:6(1-55)Online publication date: 22-Nov-2018
https://dl.acm.org/doi/10.1145/3231591
Show More Cited By

Hardness of Buy-at-Bulk Network Design
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
  2. Mathematical analysis
    1. Functional analysis
2. Theory of computation
  1. Design and analysis of algorithms
    1. Graph algorithms analysis

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 ...
Approximation algorithms for node-weighted buy-at-bulk network design
SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

We present algorithms with poly-logarithmic approximation ratios for the buy-at-bulk network design problem in the node-weighted setting. We obtain the following results where h is the number of pairs in the input.

• On O(log h) approximation for the ...

Comments

Information & Contributors

Information

Published In

FOCS '04: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science

October 2004

609 pages

ISBN:0769522289

Publisher

IEEE Computer Society

United States

Publication History

Published: 17 October 2004

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

34
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhang YZhang HCong PWang W(2024)ROND: Rethinking Overlay Network Design with Underlay Network AwarenessProceedings of the ACM on Networking10.1145/36562982:CoNEXT2(1-22)Online publication date: 13-Jun-2024
https://dl.acm.org/doi/10.1145/3656298
Emek YKutten SLavi RShi Y(2020)Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy EfficiencyJournal of the ACM10.1145/337738767:1(1-33)Online publication date: 7-Feb-2020
https://dl.acm.org/doi/10.1145/3377387
Friedrichs SLenzen C(2018)Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-FordJournal of the ACM10.1145/323159165:6(1-55)Online publication date: 22-Nov-2018
https://dl.acm.org/doi/10.1145/3231591
Emek YKutten SLavi RShi YDiakonikolas IKempe DHenzinger M(2018)Approximating generalized network design under (dis)economies of scale with applications to energy efficiencyProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188812(598-606)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188812
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
Friedrichs SLenzen CScheideler CGilbert S(2016)Parallel Metric Tree Embedding based on an Algebraic View on Moore-Bellman-FordProceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/2935764.2935777(455-466)Online publication date: 11-Jul-2016
https://dl.acm.org/doi/10.1145/2935764.2935777
Khani MSalavatipour M(2016)Improved approximations for buy-at-bulk and shallow-light $$k$$k-Steiner trees and $$(k,2)$$(k,2)-subgraphJournal of Combinatorial Optimization10.1007/s10878-014-9774-531:2(669-685)Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1007/s10878-014-9774-5
Olver NShepherd F(2014)Approximability of Robust Network DesignMathematics of Operations Research10.1287/moor.2013.062039:2(561-572)Online publication date: 1-May-2014
https://dl.acm.org/doi/10.1287/moor.2013.0620
Krishnaswamy RNagarajan VPruhs KStein CShmoys D(2014)Cluster before you hallucinateProceedings of the forty-sixth annual ACM symposium on Theory of computing10.1145/2591796.2591831(734-743)Online publication date: 31-May-2014
https://dl.acm.org/doi/10.1145/2591796.2591831
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
Show More Cited By

Abstract

Cited By

Recommendations

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

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

Approximation algorithms for node-weighted buy-at-bulk network design

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations