✦ LIBER ✦

The complexity of finding maximum disjoint paths with length constraints

✍ Scribed by A. Itai; Y. Perl; Y. Shiloach

Publisher: John Wiley and Sons
Year: 1982
Tongue: English
Weight: 416 KB
Volume: 12
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230120306

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Algorithms for Finding the Max

Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids

✍ Wun-Tat Chan; Francis Y.L. Chin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 366 KB

In a rectangular grid, given two sets of nodes, S S sources and T T sinks , of size 2 Ž . each, the disjoint paths DP problem is to connect as many nodes in S S to the Ž nodes in T T using a set of ''disjoint'' paths. Both edge-disjoint and ¨ertex-disjoint . cases are considered in this paper. Note

On the Inapproximability of Disjoint Pat

On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints

✍ Bin Ma; Lusheng Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 230 KB

In this paper, we study the inapproximability of several well-known optimization problems in network optimization. We show-that the max directed vertex-disjoint paths problem cannot be approximated within ratio 2 log 1&= n unless NP DTIME[2 polylog n ], the max directed edge-disjoint paths problem c