𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz and H. B. Hunt III

Book ID
120137087
Publisher
Springer
Year
2001
Tongue
English
Weight
108 KB
Volume
31
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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