✦ LIBER ✦

Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design

✍ Scribed by Chekuri, C.; Hajiaghayi, M. T.; Kortsarz, G.; Salavatipour, M. R.

Book ID: 118181083
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
Tongue: English
Weight: 374 KB
Volume: 39
Category: Article
ISSN: 0097-5397
DOI: 10.1137/090750317

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new approximation algorithm for the Se

A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design

✍ Peng Zhang 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 584 KB

Approximation Algorithms for Access Netw

Approximation Algorithms for Access Network Design

✍ Matthew Andrews and Lisa Zhang 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 141 KB

Approximation Algorithms for a Capacitat

Approximation Algorithms for a Capacitated Network Design Problem

✍ Refael Hassin; R. Ravi; F. Sibel Salman 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 804 KB

Approximation Algorithms for Network Des

Approximation Algorithms for Network Design with Metric Costs

✍ Cheriyan, Joseph; Vetta, Adrian 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 325 KB

Approximation Algorithms for Network Des

Approximation Algorithms for Network Design Problems on Bounded Subsets

✍ Dorit S. Hochbaum; Joseph (Seffi) Naor 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 141 KB

We address the problem of designing a network so that certain connectivity requirements are satisfied, at minimum cost of the edges used. The requirements are specified for each subset of vertices in terms of the number of edges with one endpoint in the set. We address a class of such problems, wher

Approximation Algorithms for Degree-Cons

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

✍ R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz and H. B. Hunt III 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 108 KB