Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

FOCS

2002

IEEE

2002

IEEE

We present the ﬁrst constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of multicommodity buy-at-bulk 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 ﬁxed cost. Given a graph and a set of source-sink pairs, we seek a minimum-cost way of installing sufﬁcient capacity on edges so that a prescribed amount of ﬂow can be sent simultaneously from each source to the corresponding sink. Recent work on buy-at-bulk network design has concentrated on the special case where all sinks are identical; existing constant-factor approximation algorithms for this special case make crucial use of the assumption that all commodities ship ﬂow to the same sink vertex and do not obviously extend to the multicommodity rent-or-buy p...

Related Content

Added |
14 Jul 2010 |

Updated |
14 Jul 2010 |

Type |
Conference |

Year |
2002 |

Where |
FOCS |

Authors |
Amit Kumar, Anupam Gupta, Tim Roughgarden |

Comments (0)