✦ LIBER ✦

Approximate algorithms for the discrete network design problem

✍ Scribed by Poorzahedy, Hossain; Turnquist, Mark A.

Book ID: 121198875
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 918 KB
Volume: 16
Category: Article
ISSN: 0191-2615
DOI: 10.1016/0191-2615(82)90040-6

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

Solution algorithm for the bi-level disc

Solution algorithm for the bi-level discrete network design problem

✍ Ziyou Gao; Jianjun Wu; Huijun Sun 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 350 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

Exact and approximate algorithms for opt

Exact and approximate algorithms for optimal network design

✍ R. Dionne; M. Florian 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 946 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

Approximation Algorithms for Access Netw

Approximation Algorithms for Access Network Design

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