𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On generalizations of network design problems with degree bounds

✍ Scribed by Bansal, Nikhil; Khandekar, Rohit; Könemann, Jochen; Nagarajan, Viswanath; Peis, Britta

Book ID
121625649
Publisher
Springer-Verlag
Year
2012
Tongue
English
Weight
448 KB
Volume
141
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree Bounded Network Design with Metri
Degree Bounded Network Design with Metric Costs
✍ Chan, Yuk Hei; Fung, Wai Shing; Lau, Lap Chi; Yung, Chun Kong 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 384 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