Publikationer
Failure disjoint paths
Avdelning/ar:
Publiceringsår: 2010
Språk: Engelska
Dokumenttyp: Konferensbidrag
Sammanfattning
Given a weighted directed graph where some arcs can fail while others are reliable, we aim to compute a shortest pair of failure-disjoint paths. If a reliable arc is used by both paths, its cost is counted only once. We present a polynomial time algorithm to solve the problem.
Disputation
Nyckelord
- Technology and Engineering
- shortest paths
- disjoint paths
- polynomial time algorithms
Övrigt
International Symposium on Combinatorial Optimization
2010-03-24/2010-03-26
Hammamet, Tunesia
Published
Yes
- Networking
