L. Becchetti
S. Leonardi
Abstract
In the multicommodity rent-or-buy (MROB) network design problems, we are given a network together with a set of k terminal pairs (s1, t1), …, (sk, tk. The goal is to provision the network so that a given amount of flow can be shipped between si and ti for all 1 ≤ i ≤ k simultaneously. In order to provision the network, one can either rent capacity on edges at some cost per unit of flow, or buy them at some larger fixed cost. Bought edges have no incremental, flow-dependent cost. The overall objective is to minimize the total provisioning cost.
Recently, Gupta et al. [2003a] presented a 12-approximation for the MROB problem. Their algroithm chooses a subset of the terminal pairs in the graph at random and then buys the edges of an approximate Steiner forest for these pairs. This technique had previously been introduced [Gupta et al. 2003b] for the single-sink rent-or-buy network design problem.
In this article we give a 6.828-approximation for the MROB problem by refining the algorithm of Gupta et al. and simplifying their analysis. The improvement in our article is based on a more careful adaptation and simplified analysis of the primal-dual algorithm for the Steiner forest problem due to Agrawal et al. [1995]. Our result significantly reduces the gap between the single-sink and multisink case.
- Agrawal, A., Klein, P., and Ravi, R. 1995. When trees collide: An approximation algorithm for the generalized Steiner problem in networks. SIAM J. Comput. 24, 440--456. Google Scholar
Digital Library
- Awerbuch, B., and Azar, Y. 1997. Buy-at-Bulk network design. In Proceedings of the IEEE Symposium on Foundations of Computer Science. 542--547. Google ScholarDigital Library
- Bartal, Y. 1998. On approximating arbitrary metrics by tree metrics. In Proceedings of the ACM Symposium on Theory of Computing. 161--168. Google ScholarDigital Library
- Feigenbaum, J., Papadimitriou, C. H., and Shenker, S. 2001. Sharing the cost of multicast transmissions. J. Comput. Syst. Sci. 63, 21--41. Google ScholarDigital Library
- Fleischer, L., Könemann, J., Leonardi, S., and Schäfer, G. 2006. Simple cost sharing schemes for multi-commodity rent-or-buy and stochastic Steiner tree. In Proceedings of the ACM Symposium on Theory of Computing. 663--670. Google ScholarDigital Library
- Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability: A Quide to the Theory of NP-Completeness. W. H. Freeman, San Francisco. Google ScholarDigital Library
- Goemans, M. X., and Williamson, D. P. 1995. A general approximation technique for constrained forest problems. SIAM J. Comput. 24, 296--317. Google ScholarDigital Library
- Gupta, A., Kumar, A., Pal, M., and Roughgarden, T. 2003a. Approximation via cost-sharing: A simple approximation algorithm for the multicommodity rent-or-buy problem. In Proceedings of the IEEE Symposium on Foundations of Computer Science. 606--615. Google ScholarDigital Library
- Gupta, A., Kumar, A., and Roughgarden, T. 2003b. Simpler and better approximation algorithms for network design. In Proceedings of the ACM Symposium on Theory of Computing. 365--372. Google ScholarDigital Library
- Gupta, A., Pál, M., Ravi, R., and Sinha, A. 2004. Boosted sampling: Approximation algorithms for stochastic optimization. In Proceedings of the ACM Symposium on Theory of Computing. 417--426. Google ScholarDigital Library
- Jain, K., and Vazirani, V. V. 2001. Applications of approximation algorithms to cooperative games. In Proceedings of the ACM Symposium on Theory of Computing. 364--372. Google ScholarDigital Library
- Kumar, A., Gupta, A., and Roughgarden, T. 2002. A constant-factor approximation algorithm for the multicommodity. In Proceedings of the IEEE Symposium on Foundations of Computer Science. 333--344. Google ScholarDigital Library
- Pál, M., and Tardos, É. 2003. Group strategyproof mechanisms via primal-dual algorithms. In Proceedings of the IEEE Symposium on Foundations of Computer Science. Google ScholarDigital Library
Index Terms
- Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy
Recommendations
Approximation via cost sharing: Simpler and better approximation algorithms for network design
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 ...
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of ComputingIn the multi-commodity rent-or-buy network design problem (MRoB) we are given a network together with a set of k terminal pairs R = (s_1, t_1), ..., (s_k, t_k). The goal is to install capacities on the edges of the network so that a prescribed amount of ...
Improved approximations for buy-at-bulk and shallow-light $$k$$k-Steiner trees and $$(k,2)$$(k,2)-subgraph
In this paper we give improved approximation algorithms for some network design problems. In the bounded-diameter or shallow-light $$k$$k-Steiner tree problem (SL$$k$$kST), we are given an undirected graph $$G=(V,E)$$G=(V,E) with terminals $$T\subseteq ...
Comments