✦ LIBER ✦

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

✍ Scribed by Guo, Longkun; Shen, Hong; Liao, Kewen

Book ID: 121594690
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 287 KB
Volume: 29
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-013-9693-x

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

A genetic algorithm for finding a path s

A genetic algorithm for finding a path subject to two constraints

✍ Lu, Ting; Zhu, Jie 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 656 KB

An efficient algorithm for finding a pat

An efficient algorithm for finding a path subject to two additive constraints

✍ Turgay Korkmaz; Marwan Krunz; Spyros Tragoudas 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 616 KB

One of the key issues in providing end-to-end quality-of-service (QoS) guarantees in packet networks is how to determine a feasible path that satis®es a number of QoS constraints. For two or more additive constraints, the problem of ®nding a feasible path is NP-complete that cannot be exactly solved