TY - GEN

T1 - Multipath Spanners via Fault-Tolerant Spanners

AU - Chechik, Shiri

AU - Godfroy, Quentin

AU - Peleg, David

N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2012.

PY - 2012

Y1 - 2012

N2 - An s-spanner H of a graph G is a subgraph such that the distance between any two vertices u and v in H is greater by at most a multiplicative factor s than the distance in G. Inthispaper,wefocuson an extension of the concept of spanners to p-multipath distance, defined as the smallest length of a collection of p pairwise (vertex or edge) disjoint paths. The notion of multipath spanners was introduced in [15, 16] for edge (respectively, vertex) disjoint paths. This paper significantly improves the stretch-size tradeoff result of the two previous papers, using the related concept of fault-tolerant s-spanners, introduced in [6] for general graphs. More precisely, we show that at the cost of increasing the number of edges by a polynomial factor in p and s, it is possible to obtain an s-multipath spanner, thereby improving on the large stretch obtained in [15, 16].

AB - An s-spanner H of a graph G is a subgraph such that the distance between any two vertices u and v in H is greater by at most a multiplicative factor s than the distance in G. Inthispaper,wefocuson an extension of the concept of spanners to p-multipath distance, defined as the smallest length of a collection of p pairwise (vertex or edge) disjoint paths. The notion of multipath spanners was introduced in [15, 16] for edge (respectively, vertex) disjoint paths. This paper significantly improves the stretch-size tradeoff result of the two previous papers, using the related concept of fault-tolerant s-spanners, introduced in [6] for general graphs. More precisely, we show that at the cost of increasing the number of edges by a polynomial factor in p and s, it is possible to obtain an s-multipath spanner, thereby improving on the large stretch obtained in [15, 16].

UR - http://www.scopus.com/inward/record.url?scp=85109701344&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-34862-4_8

DO - 10.1007/978-3-642-34862-4_8

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85109701344

SN - 9783642348617

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 108

EP - 119

BT - Design and Analysis of Algorithms - 1st Mediterranean Conference on Algorithms, MedAlg 2012, Proceedings

A2 - Even, Guy

A2 - Rawitz, Dror

PB - Springer Science and Business Media Deutschland GmbH

T2 - 1st Mediterranean Conference on Algorithms, MedAlg 2012

Y2 - 3 December 2012 through 5 December 2012

ER -