
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Amit Kumar, Anupam Gupta, Tim Roughgarden, "A ConstantFactor Approximation Algorithm for the Multicommodity RentorBuy Problem," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 333, The 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02), 2002.  
BibTex  x  
@article{ 10.1109/SFCS.2002.1181956, author = {Amit Kumar and Anupam Gupta and Tim Roughgarden}, title = {A ConstantFactor Approximation Algorithm for the Multicommodity RentorBuy Problem}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {2002}, issn = {02725428}, pages = {333}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181956}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  A ConstantFactor Approximation Algorithm for the Multicommodity RentorBuy Problem SN  02725428 SP EP A1  Amit Kumar, A1  Anupam Gupta, A1  Tim Roughgarden, PY  2002 KW  null VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
We present the first constantfactor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rentorbuy problem, a type of multicommodity buyatbulk network design in which there are two ways to install capacity on any given edge. Capacity can be rented, with cost incurred on a perunit of capacity basis, or bought, which allows unlimited use after payment of a large fixed cost. Given a graph and a set of sourcesink pairs, we seek a minimumcost 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.
Recent work on buyatbulk network design has concentrated on the special case where all sinks are identical; existing constantfactor approximation algorithms for this special case make crucial use of the assumption that all commodities ship flow to the same sink vertex and do not obviously extend to the multicommodity rentorbuy problem. Prior to our work, the best heuristics for the multicommodity rentorbuy problem achieved only logarithmic performance guarantees and relied on the machinery of relaxed metrical task systems or of metric embeddings. By contrast, we solve the network design problem directly via a novel primaldual algorithm.