✦ LIBER ✦

Approximating capacitated tree-routings in networks

✍ Scribed by Ehab Morsy; Hiroshi Nagamochi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Design of capacitated networks with tree

✍ Kyungsik Lee; Kyungchul Park; Sungsoo Park 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 1023 KB

A New Approximation Algorithm for the Ca

✍ Tetsuo Asano; Naoki Katoh; Kazuhiro Kawashima 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 93 KB

Flow trees for vertex-capacitated networ

✍ Refael Hassin; Asaf Levin 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 152 KB

Approximation Algorithms for Soft-Capaci

✍ Xujin Chen; Bo Chen 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 796 KB

Fault-tolerant routings in chordal ring

✍ Lali Barrière; Josep Fàbrega; Ester Simó; Marisa Zaragozá 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 378 KB 👁 1 views

Tree-forming reversible routes in commun

✍ Alistair A.R. Cockburn 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 1015 KB