Approximation via cost-sharing: A simple approximation algorithm for the multicommodity rent-or-buy problem

Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden

Research output: Contribution to journalConference articlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)606-615
Number of pages10
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
StatePublished - 2003
EventProceedings: 44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003 - Cambridge, MA, United States
Duration: Oct 11 2003Oct 14 2003

ASJC Scopus subject areas

  • Hardware and Architecture


Dive into the research topics of 'Approximation via cost-sharing: A simple approximation algorithm for the multicommodity rent-or-buy problem'. Together they form a unique fingerprint.

Cite this