✦ LIBER ✦

Degree Bounded Network Design with Metric Costs

✍ Scribed by Chan, Yuk Hei; Fung, Wai Shing; Lau, Lap Chi; Yung, Chun Kong

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for Network Des

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

Additive Guarantees for Degree-Bounded D

✍ Bansal, Nikhil; Khandekar, Rohit; Nagarajan, Viswanath 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 338 KB

Cost-Distance: Two Metric Network Design

✍ Meyerson, Adam; Munagala, Kamesh; Plotkin, Serge 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 198 KB

Multicommodity network design with discr

✍ P. Belotti; F. Malucelli; L. Brunetta 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB

Lower bounding techniques for the degree

✍ Güvenç Şahin; Ravindra K. Ahuja 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB 👁 1 views

Approximation Algorithms for Degree-Cons

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