✦ LIBER ✦

Approximation Algorithms for Access Network Design

✍ Scribed by Matthew Andrews and Lisa Zhang

Book ID: 120136562
Publisher: Springer
Year: 2002
Tongue: English
Weight: 141 KB
Volume: 34
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-002-0968-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 Nonuniform

Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design

✍ Chekuri, C.; Hajiaghayi, M. T.; Kortsarz, G.; Salavatipour, M. R. 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 374 KB

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

A Tabu Search Algorithm for Access Netwo

A Tabu Search Algorithm for Access Network Design

✍ André Girard; Brunilde Sansò; Linda Dadjo 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 259 KB