✦ LIBER ✦

On Finding Min-Min Disjoint Paths

✍ Scribed by Longkun Guo, Hong Shen

Book ID: 120909992
Publisher: Springer
Year: 2012
Tongue: English
Weight: 523 KB
Volume: 66
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-012-9656-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of finding two disjoint p

The complexity of finding two disjoint paths with min-max objective function

✍ Chung-Lun Li; S.Thomas McCormick; David Simchi-Levi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 689 KB

A note on approximating the min–max vert

A note on approximating the min–max vertex disjoint paths on directed acyclic graphs

✍ Bang Ye Wu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 124 KB

On the complexity of the edge-disjoint m

On the complexity of the edge-disjoint min–min problem in planar digraphs

✍ Longkun Guo; Hong Shen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 342 KB

Finding Edge-Disjoint Paths in Partialk-

Finding Edge-Disjoint Paths in Partialk-Trees

✍ X. Zhou; S. Tamura; T. Nishizeki 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 339 KB

Finding disjoint paths with related path

Finding disjoint paths with related path costs

✍ Randeep Bhatia; Murali Kodialam; T. V. Lakshman 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 367 KB

We consider routing in survivable networks that provide protection against node or link failures. In these networks resilience against failures is provided by routing connections on pairs of disjoint paths called primary and backup paths. The primary path of a connection carries its traffic under no

Resilient routing in optical networks us

Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost

✍ Teresa Gomes, Carlos Simões, Luís Fernandes 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 730 KB