A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners
[chapter]
2011
Lecture Notes in Computer Science
Motivated by multipath routing, we introduce a multiconnected variant of spanners. For that purpose we introduce the pmultipath cost between two nodes u and v as the minimum weight of a collection of p internally vertex-disjoint paths between u and v. Given a weighted graph G, a subgraph H is a p-multipath s-spanner if for all u, v, the p-multipath cost between u and v in H is at most s times the p-multipath cost in G. The s factor is called the stretch. Building upon recent results on
doi:10.1007/978-3-642-25873-2_11
fatcat:gkkrferctzcxpec4ffymmrnty4