𝔖 Bobbio Scriptorium

✦ LIBER ✦

Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length

✍ Scribed by Victor Chepoi; Bertrand Estellon; Yann Vaxès

Book ID: 108281439
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 974 KB
Volume: 401
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.03.028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved algorithms for finding length-b

Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph

✍ Chih-Chiang Yu; Chien-Hsin Lin; Biing-Feng Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 323 KB

[ACM Press the 43rd annual ACM symposium

[ACM Press the 43rd annual ACM symposium - San Jose, California, USA (2011.06.06-2011.06.08)] Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 - Breaking o(n 1/2 )-approximation algorithms for the edge-disjoint paths problem with congestion two

✍ Kawarabayashi, Ken-ichi; Kobayashi, Yusuke 📂 Article 📅 2011 🏛 ACM Press ⚖ 422 KB