Failure disjoint paths

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.

Saved in:
Bibliographic Details
Published inElectronic notes in discrete mathematics Vol. 36; no. 1; pp. 1105 - 1112
Main Authors Zotkiewicz, Mateusz, Ben-Ameur, Walid, Pioro, Michal
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.08.2010
Elsevier
Subjects
Computer Science
Discrete Mathematics
disjoint paths
Electrical Engineering, Electronic Engineering, Information Engineering
Elektroteknik och elektronik
Engineering and Technology
polynomial time algorithms
shortest paths
Teknik
polynomial time algorithms
shortest paths
disjoint paths
Shortest paths
Disjoint paths
Polynomial time algorithms
Online AccessGet full text

Cover

Abstract 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.
AbstractList 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.
Author Ben-Ameur, W.
Żotkiewicz, Mateusz
Pióro, Michał
Author_xml – sequence: 1
  givenname: Mateusz
  surname: Zotkiewicz
  fullname: Zotkiewicz, Mateusz
  organization: Département Réseaux et Services Multimédia Mobiles
– sequence: 2
  givenname: Walid
  orcidid: 0000-0003-2865-1123
  surname: Ben-Ameur
  fullname: Ben-Ameur, Walid
  organization: Département Réseaux et Services Multimédia Mobiles
– sequence: 3
  givenname: Michal
  surname: Pioro
  fullname: Pioro, Michal
  organization: Institute of Telecommunications
BackLink https://hal.science/hal-00528050$$DView record in HAL
https://lup.lub.lu.se/record/1719982$$DView record from Swedish Publication Index
BookMark eNp9kM1Lw0AQxRepYFu9evDUq4fE2Wx2k4CXUqwVAl70PGz2g25Ik5BtK_73boiIXjwMMzzeewO_BZm1XWsIuaMQU6DioY5Nqw9xAkEAHtMULsic8oxGIDib_bqvyML7GoDlNONzcruVrjkNZqWdrzvXHle9PO79Nbm0svHm5nsvyfv26W2zi8rX55fNuowUo7mORE5NwjJeVKKyacZFQrXllTUgWa6kZbqSKpVponKR6kJrxihLK6tBFZKBZktSTr3-w_SnCvvBHeTwiZ102Jz6MFUY9Aa11lZlgmKhZIaprFLMBbXIbPiWWZHlaqy7n-r2svnTtVuXOGoAPMmBw5kGbzJ51dB5Pxj7E6CAI1SscYSKI1QEjgFqCD1OIROgnJ0Z0CtnWmW0G4w6ou7cf_EvsEyAeQ
CitedBy_id crossref_primary_10_1016_j_cor_2015_05_009
Cites_doi 10.1002/net.3230040204
10.1007/BF01386390
10.1002/net.3230140209
ContentType Journal Article
Copyright 2010 Elsevier B.V.
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: 2010 Elsevier B.V.
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
1XC
ADTPV
AOWAS
D95
DOI 10.1016/j.endm.2010.05.140
DatabaseName CrossRef
Hyper Article en Ligne (HAL)
SwePub
SwePub Articles
SWEPUB Lunds universitet
DatabaseTitle CrossRef
DatabaseTitleList


DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1571-0653
EndPage 1112
ExternalDocumentID oai_lup_lub_lu_se_dddfc761_9ca7_4ab4_861f_3ffe07f678cd
oai_HAL_hal_00528050v1
10_1016_j_endm_2010_05_140
S1571065310001411
GroupedDBID --K
--M
.~1
0R~
1B1
1~.
1~5
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AASFE
AAXUO
ABAOU
ABJNI
ABMAC
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACNNM
ACRLP
ACXMD
ADBBV
ADEZE
ADGUI
ADMUD
AEBSH
AEKER
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AIEXJ
AIGVJ
AIKHN
AITUG
AJMQA
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
IHE
J1W
KOM
M41
MHUIS
MO0
M~E
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SDF
SDG
SES
SEW
SPC
SPCBC
SSB
SSD
SSV
SSW
SSZ
T5K
~G-
AAXKI
AAYXX
AKRWK
CITATION
1XC
SDK
ADTPV
AOWAS
D95
ID FETCH-LOGICAL-c318d-681e23759b6bf475621df5bfe0a38caf3dbac4a42c864d9dd33134bfd0c9a30d3
IEDL.DBID .~1
ISSN 1571-0653
IngestDate Tue Oct 01 22:45:45 EDT 2024
Tue Oct 15 16:01:19 EDT 2024
Thu Sep 12 20:17:04 EDT 2024
Fri Feb 23 02:23:32 EST 2024
IsPeerReviewed false
IsScholarly true
Issue 1
Keywords polynomial time algorithms
shortest paths
disjoint paths
Shortest paths
Disjoint paths
Polynomial time algorithms
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c318d-681e23759b6bf475621df5bfe0a38caf3dbac4a42c864d9dd33134bfd0c9a30d3
ORCID 0000-0003-2865-1123
PageCount 8
ParticipantIDs swepub_primary_oai_lup_lub_lu_se_dddfc761_9ca7_4ab4_861f_3ffe07f678cd
hal_primary_oai_HAL_hal_00528050v1
crossref_primary_10_1016_j_endm_2010_05_140
elsevier_sciencedirect_doi_10_1016_j_endm_2010_05_140
PublicationCentury 2000
PublicationDate 2010-08-00
PublicationDateYYYYMMDD 2010-08-01
PublicationDate_xml – month: 08
  year: 2010
  text: 2010-08-00
PublicationDecade 2010
PublicationTitle Electronic notes in discrete mathematics
PublicationYear 2010
Publisher Elsevier B.V
Elsevier
Publisher_xml – name: Elsevier B.V
– name: Elsevier
References Dijkstra (bib002) 1959; 1
Suurballe (bib004) 1974; 4
Pióro, Medhi (bib003) 2004
Suurballe, Tarjan (bib005) 1984; 14
Ahuja, Magnanti, Orlin (bib001) 1993
Suurballe (10.1016/j.endm.2010.05.140_bib004) 1974; 4
Suurballe (10.1016/j.endm.2010.05.140_bib005) 1984; 14
Dijkstra (10.1016/j.endm.2010.05.140_bib002) 1959; 1
Pióro (10.1016/j.endm.2010.05.140_bib003) 2004
Ahuja (10.1016/j.endm.2010.05.140_bib001) 1993
References_xml – year: 1993
  ident: bib001
  article-title: Network Flows: Theory, Algorithms, and Applications
  contributor:
    fullname: Orlin
– volume: 1
  start-page: 269
  year: 1959
  end-page: 271
  ident: bib002
  article-title: A note on two problems in connexion with graphs
  publication-title: Numerische Mathematik
  contributor:
    fullname: Dijkstra
– volume: 4
  start-page: 125
  year: 1974
  end-page: 145
  ident: bib004
  article-title: Disjoint paths in a network
  publication-title: Networks
  contributor:
    fullname: Suurballe
– year: 2004
  ident: bib003
  article-title: Routing, Flow, and Capacity Design in Communication and Computer Networks
  contributor:
    fullname: Medhi
– volume: 14
  start-page: 325
  year: 1984
  end-page: 336
  ident: bib005
  article-title: A quick method for finding shortest pairs of disjoint paths
  publication-title: Networks
  contributor:
    fullname: Tarjan
– year: 2004
  ident: 10.1016/j.endm.2010.05.140_bib003
  contributor:
    fullname: Pióro
– volume: 4
  start-page: 125
  year: 1974
  ident: 10.1016/j.endm.2010.05.140_bib004
  article-title: Disjoint paths in a network
  publication-title: Networks
  doi: 10.1002/net.3230040204
  contributor:
    fullname: Suurballe
– volume: 1
  start-page: 269
  year: 1959
  ident: 10.1016/j.endm.2010.05.140_bib002
  article-title: A note on two problems in connexion with graphs
  publication-title: Numerische Mathematik
  doi: 10.1007/BF01386390
  contributor:
    fullname: Dijkstra
– volume: 14
  start-page: 325
  issue: 2
  year: 1984
  ident: 10.1016/j.endm.2010.05.140_bib005
  article-title: A quick method for finding shortest pairs of disjoint paths
  publication-title: Networks
  doi: 10.1002/net.3230140209
  contributor:
    fullname: Suurballe
– year: 1993
  ident: 10.1016/j.endm.2010.05.140_bib001
  contributor:
    fullname: Ahuja
SSID ssj0038175
Score 1.828061
Snippet 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...
SourceID swepub
hal
crossref
elsevier
SourceType Open Access Repository
Aggregation Database
Publisher
StartPage 1105
SubjectTerms Computer Science
Discrete Mathematics
disjoint paths
Electrical Engineering, Electronic Engineering, Information Engineering
Elektroteknik och elektronik
Engineering and Technology
polynomial time algorithms
shortest paths
Teknik
Title Failure disjoint paths
URI https://dx.doi.org/10.1016/j.endm.2010.05.140
https://hal.science/hal-00528050
https://lup.lub.lu.se/record/1719982
Volume 36
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF6qXrz4Fp8liDeJ3XQf2RxLsVStRXyAt2WfmKKx2OrR3-5sHkIPevCwBJaETL7szswO38wgdKoZI-Am6BgbpmKqMhdn2JpYcO-74OATpUJo4GbMh4_06ok9tVC_yYUJtMpa91c6vdTW9UynRrMzzfPOfcLAOnJWRqgTWub3UjB_sKbPv35oHqEAHStrpqaB4cNInThTcbxcYV9rehcDnYF_M05Lz4EluVBLtLQ_gw20VjuOUa-SbRO1XLGF1pumDFG9R7fR7kDlgWoe2Xw2ecuLeRSaDs920OPg4qE_jOvmB7GBbWZjLhLXJSnLNNeepuCmJNYz7R1WRBjlidXKUEW7RnBqM2sJSQjV3mKTKYIt2UXLxVvh9lAkjDBdZ6nXDo5zXglw-ahTHFRb6FOU7KOz5qvltKpxIRvy10QGjGTASGIGBwW8j1gDjFz4UxKU8J_PnQCKPy8IZa2HvZEMcyE2LTDDnyDKRQXywn0vH1MYGoacOWmt9SblicyMSiVVmkrBEy-JB3BSD9bX2IN_CnmIVit6QGD4HaHl-fuHOwavY67b5bJqo5Ve_250G66X18PxN3kw1nE
link.rule.ids 230,315,783,787,888,4509,24128,27936,27937,45597,45691
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELagDLDwRryJEBsKdepHnLFCVAXaLlCpm-WnCIJQ0cLIb-ecB1IHGBi8WInifLbvPp8-3yF0oRkjQBN0jA1TMVWZizNsTSy49x0g-ESpEBoYjnh_TO8mbLKErpu7MEFWWdv-yqaX1rruaddotqd53n5IGHhHzsoIdULD_d4VGvgxLOqrrx-dR8hAx8qkqWmQ-DBS35ypRF6usK-1vouB0cC_eaflpyCTXEgmWjqg3iZar5lj1K0Gt4WWXLGNNpqqDFG9SXfQXk_lQWse2Xz2_JYX8yhUHZ7tonHv5vG6H9fVD2ID-8zGXCSuQ1KWaa49TYGnJNYz7R1WRBjlidXKUEU7RnBqM2sJSQjV3mKTKYIt2UOt4q1w-ygSRpiOs9RrB-c5rwRwPuoUB9sWChUlB-iy-Ws5rZJcyEb99SwDRjJgJDGDkwI-QKwBRi5MlQQr_Od754DizwdCXut-dyBDXwhOC8zwJwzlpgJ54bmXjyk0DU3OnLTWepPyRGZGpZIqTaXgiZfEAzipB_dr7OE_B3mGVvuPw4Ec3I7uj9BapRUIcr9j1Jq_f7gToCBzfVousW_s4tZ1
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Failure+disjoint+paths&rft.jtitle=Electronic+notes+in+discrete+mathematics&rft.au=Zotkiewicz%2C+Mateusz&rft.au=Ben-Ameur%2C+Walid&rft.au=Pioro%2C+Michal&rft.date=2010-08-01&rft.pub=Elsevier&rft.issn=1571-0653&rft.eissn=1571-0653&rft.volume=36&rft.issue=1&rft.spage=1105&rft.epage=1112&rft_id=info:doi/10.1016%2Fj.endm.2010.05.140&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai_HAL_hal_00528050v1
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1571-0653&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1571-0653&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1571-0653&client=summon