Approximation via cost sharing: Simpler and better approximation algorithms for network design

Authors:
Anupam Gupta;Amit Kumar;Martin P´al;Tim Roughgarden
Affiliations:
Carnegie Mellon University, Pittsburgh, Pennsylvania;Indian Institute of Technology, New Delhi, India;Google, Inc., New York, New York;Stanford University, Stanford, California
Venue:
Journal of the ACM (JACM)
Year:
2007

Citing 54
Cited 24

The steiner problem with edge lengths 1 and 2,

Information Processing Letters
A data structure for bicategories, with application to speeding up an approximation algorithm

Information Processing Letters
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks

SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
Competitive algorithms for distributed data management

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
The primal-dual method for approximation algorithms and its application to network design problems

Approximation algorithms for NP-hard problems
Designing least-cost nonblocking broadband networks

Journal of Algorithms
On approximating arbitrary metrices by tree metrics

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
A flexible model for resource management in virtual private networks

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A faster implementation of the Goemans-Williamson clustering algorithm

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A deterministic algorithm for the cost-distance problem

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Applications of approximation algorithms to cooperative games

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A constant factor approximation for the single sink edge installation problems

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Provisioning a virtual private network: a network design problem for multicommodity flow

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms

Approximation algorithms
On page migration and other relaxed task systems

Theoretical Computer Science
Equitable cost allocations via primal-dual-type algorithms

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximating the Single-Sink Link-Installation Problem in Network Design

SIAM Journal on Optimization
The general Steiner tree-star problem

Information Processing Letters
A Constant-Factor Approximation Algorithm for the Multicommodity

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Simpler and better approximation algorithms for network design

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Buy-at-bulk network design

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Cost-distance: two metric network design

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Building Steiner trees with incomplete global knowledge

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Hierarchical placement and network design problems

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Designing Networks Incrementally

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Group Strategyproof Mechanisms via Primal-Dual Algorithms

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Boosted sampling: approximation algorithms for stochastic optimization

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Primal–Dual Algorithms for Connected Facility Location Problems

Algorithmica
Hardness of Buy-at-Bulk Network Design

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
A tight bound on approximating arbitrary metrics by tree metrics

Journal of Computer and System Sciences - Special issue: STOC 2003
On-line generalized Steiner problem

Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
On non-uniform multicommodity buy-at-bulk network design

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A group-strategyproof mechanism for Steiner forests

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An improved approximation algorithm for virtual private network design

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Network design for information networks

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Tighter Bounds for Graph Steiner Tree Approximation

SIAM Journal on Discrete Mathematics
Oblivious network design

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems

Mathematical Programming: Series A and B
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Stochastic steiner trees without a root

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
New approaches for virtual private network design

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
What about wednesday? approximation algorithms for multistage stochastic optimization

APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Improved approximation for single-sink buy-at-bulk

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A simpler and better derandomization of an approximation algorithm for single source rent-or-buy

Operations Research Letters

Approximating connected facility location problems via random facility sampling and core detouring

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic Sampling Algorithms for Network Design

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Combinatorial optimization in system configuration design

Automation and Remote Control
A constant-factor approximation for stochastic Steiner forest

Proceedings of the forty-first annual ACM symposium on Theory of computing
Online and stochastic survivable network design

Proceedings of the forty-first annual ACM symposium on Theory of computing
Competitive cost sharing with economies of scale

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
An improved LP-based approximation for steiner tree

Proceedings of the forty-second ACM symposium on Theory of computing
Connected facility location via random facility sampling and core detouring

Journal of Computer and System Sciences
Approximability of robust network design

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Tree embeddings for two-edge-connected network design

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Network design via core detouring for problems without a core

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Design of network topology in an adversarial environment

GameSec'10 Proceedings of the First international conference on Decision and game theory for security
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design

SIAM Journal on Computing
Designing Network Protocols for Good Equilibria

SIAM Journal on Computing
The VPN Problem with Concave Costs

SIAM Journal on Discrete Mathematics
Buy-at-Bulk Network Design with Protection

Mathematics of Operations Research
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk

Mathematics of Operations Research
Approximation algorithms for single and multi-commodity connected facility location

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Strict Cost Sharing Schemes for Steiner Forest

SIAM Journal on Computing
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems

SIAM Journal on Computing
Minimizing rosenthal potential in multicast games

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Steiner Tree Approximation via Iterative Randomized Rounding

Journal of the ACM (JACM)
A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present constant-factor approximation algorithms for several widely-studied NP-hard optimization problems in network design, including the multicommodity rent-or-buy, virtual private network design, and single-sink buy-at-bulk problems. Our algorithms are simple and their approximation ratios improve over those previously known, in some cases by orders of magnitude. We develop a general analysis framework to bound the approximation ratios of our algorithms. This framework is based on a novel connection between random sampling and game-theoretic cost sharing.