Du är här

Failure disjoint paths

Författare:
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

Övriga

International Symposium on Combinatorial Optimization
2010-03-24/2010-03-26
Hammamet, Tunesia
Published
Yes
  • Networking

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

LERU logotype U21 logotype

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen