Multipath Spanners via Fault-Tolerant Spanners

Shiri Chechik; Quentin Godfroy; David Peleg

doi:10.1007/978-3-642-34862-4_8

Multipath Spanners via Fault-Tolerant Spanners

Shiri Chechik
, Quentin Godfroy
, David Peleg

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

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].

Original language	English
Title of host publication	Design and Analysis of Algorithms - 1st Mediterranean Conference on Algorithms, MedAlg 2012, Proceedings
Editors	Guy Even, Dror Rawitz
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	108-119
Number of pages	12
ISBN (Print)	9783642348617
DOIs	https://doi.org/10.1007/978-3-642-34862-4_8
State	Published - 2012
Externally published	Yes
Event	1st Mediterranean Conference on Algorithms, MedAlg 2012 - Kibbutz Ein Gedi, Israel Duration: 3 Dec 2012 → 5 Dec 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7659 LNNS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	1st Mediterranean Conference on Algorithms, MedAlg 2012
Country/Territory	Israel
City	Kibbutz Ein Gedi
Period	3/12/12 → 5/12/12

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2012.

Funding

★Supported in part by the Israel Science Foundation (grant 894/09), the United States-Israel Binational Science Foundation (grant 2008348), the Israel Ministry of Science and Technology (infrastructures grant), and the Citi Foundation. ★★ Supported by the Institut Universitaire de France.

Funders	Funder number
Citi Foundation
United States-Israel Binational Science Foundation	2008348
Israel Science Foundation	894/09
Institut universitaire de France
Ministry of science and technology, Israel

Access to Document

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

Cite this

Chechik, S., Godfroy, Q., & Peleg, D. (2012). Multipath Spanners via Fault-Tolerant Spanners. In G. Even, & D. Rawitz (Eds.), Design and Analysis of Algorithms - 1st Mediterranean Conference on Algorithms, MedAlg 2012, Proceedings (pp. 108-119). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7659 LNNS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-642-34862-4_8

Chechik, Shiri ; Godfroy, Quentin ; Peleg, David. / Multipath Spanners via Fault-Tolerant Spanners. Design and Analysis of Algorithms - 1st Mediterranean Conference on Algorithms, MedAlg 2012, Proceedings. editor / Guy Even ; Dror Rawitz. Springer Science and Business Media Deutschland GmbH, 2012. pp. 108-119 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{673a9fcce1fb4eb889589690e016be39,

title = "Multipath Spanners via Fault-Tolerant Spanners",

abstract = "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].",

author = "Shiri Chechik and Quentin Godfroy and David Peleg",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2012.; 1st Mediterranean Conference on Algorithms, MedAlg 2012 ; Conference date: 03-12-2012 Through 05-12-2012",

year = "2012",

doi = "10.1007/978-3-642-34862-4\_8",

language = "אנגלית",

isbn = "9783642348617",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "108--119",

editor = "Guy Even and Dror Rawitz",

booktitle = "Design and Analysis of Algorithms - 1st Mediterranean Conference on Algorithms, MedAlg 2012, Proceedings",

address = "גרמניה",

}

Chechik, S, Godfroy, Q & Peleg, D 2012, Multipath Spanners via Fault-Tolerant Spanners. in G Even & D Rawitz (eds), Design and Analysis of Algorithms - 1st Mediterranean Conference on Algorithms, MedAlg 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7659 LNNS, Springer Science and Business Media Deutschland GmbH, pp. 108-119, 1st Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, 3/12/12. https://doi.org/10.1007/978-3-642-34862-4_8

Multipath Spanners via Fault-Tolerant Spanners. / Chechik, Shiri; Godfroy, Quentin; Peleg, David.
Design and Analysis of Algorithms - 1st Mediterranean Conference on Algorithms, MedAlg 2012, Proceedings. ed. / Guy Even; Dror Rawitz. Springer Science and Business Media Deutschland GmbH, 2012. p. 108-119 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7659 LNNS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Multipath Spanners via Fault-Tolerant Spanners

AU - Chechik, Shiri

AU - Godfroy, Quentin

AU - Peleg, David

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 - https://www.scopus.com/pages/publications/85109701344

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 -

Chechik S, Godfroy Q, Peleg D. Multipath Spanners via Fault-Tolerant Spanners. In Even G, Rawitz D, editors, Design and Analysis of Algorithms - 1st Mediterranean Conference on Algorithms, MedAlg 2012, Proceedings. Springer Science and Business Media Deutschland GmbH. 2012. p. 108-119. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-34862-4_8

Multipath Spanners via Fault-Tolerant Spanners

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this