✦ LIBER ✦

1-Approximation algorithm for bottleneck disjoint path matching

✍ Scribed by Alak K. Datta; Ranjan K. Sen

Book ID: 107766248
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 331 KB
Volume: 55
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00031-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parameterized and approximation algorith

Parameterized and approximation algorithms for finding two disjoint matchings

✍ Chen, Zhi-Zhong; Fan, Ying; Wang, Lusheng 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 546 KB

Approximation algorithms for forests aug

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

✍ Victor Chepoi; Bertrand Estellon; Yann Vaxès 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 974 KB

Improved approximation algorithms for co

Improved approximation algorithms for computing\(k\)disjoint paths subject to two constraints

✍ Guo, Longkun; Shen, Hong; Liao, Kewen 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 287 KB

Near-optimal hardness results and approx

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

✍ Venkatesan Guruswami; Sanjeev Khanna; Rajmohan Rajaraman; Bruce Shepherd; Mihali 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 308 KB

We study the approximability of edge-disjoint paths and related problems. In the edge-disjoint paths (EDP) problem, we are given a network G with source-sink pairs ðs i ; t i Þ; 1pipk; and the goal is to find a largest subset of source-sink pairs that can be simultaneously connected in an edge-disjo

Approximation algorithms for covering a

Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight

✍ Shlomo Moran; Ilan Newman; Yaron Wolfstahl 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 464 KB

Algorithms for approximate string matchi

Algorithms for approximate string matching

✍ Esko Ukkonen 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 867 KB