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
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
Bidimensionality: new connections between FPT algorithms and PTASs
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
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy
ACM Transactions on Algorithms (TALG)
Proceedings of the 8th ACM conference on Electronic commerce
Approximation algorithms for node-weighted buy-at-bulk network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating connected facility location problems via random facility sampling and core detouring
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
Optimal Efficiency Guarantees for Network Design Mechanisms
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Deterministic Sampling Algorithms for Network Design
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A constant approximation algorithm for the a priori traveling salesman problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Connected facility location via random facility sampling and core detouring
Journal of Computer and System Sciences
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
Strict Cost Sharing Schemes for Steiner Forest
SIAM Journal on Computing
Stochastic steiner trees without a root
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Prize-collecting steiner networks via iterative rounding
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
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
Approximating buy-at-bulk and shallow-light k-Steiner trees
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Improved approximation for single-sink buy-at-bulk
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Improved approximations for buy-at-bulk and shallow-light k-steiner trees and (k,2)-subgraph
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A note on the subadditive network design problem
Operations Research Letters
A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
Operations Research Letters
Hi-index | 0.00 |
We study the multicommodity rent-or-buy problem, a type of network design problem with economies of scale. In this problem, capacity on an edge can be rented, with cost incurred on a per-unit of capacity basis, or bought, which allows unlimited use after payment of a large fixed cost. Given a graph and a set of source-sink pairs, we seek a minimum-cost way of installing sufficient capacity on edges so that a prescribed amount of flow can be sent simultaneously from each source to the corresponding sink. The first constant-factor approximation algorithm for this problem was recently given by Kumar et al. (FOCS '02); however, this algorithm and its analysis are both quite complicated, and its performance guarantee is extremely large.In this paper, we give a conceptually simple 12-approximation algorithm for this problem. Our analysis of this algorithm makes crucial use of cost sharing, the task of allocating the cost of an object to many users of the object in a "fair" manner. While techniques from approximation algorithms have recently yielded new progress on cost sharing problems, our work is the first to show the converse 驴 that ideas from cost sharing can be fruitfully applied in the design and analysis of approximation algorithms.