Finding sparser directed spanners

Piotr Berman, Sofya Raskhodnikova, Ge Ruan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V,E H) is a k-spanner of a graph G = (V,E) if for every pair of vertices u, v ∈ V, the shortest path distance distH(u,v) from u to v in H is at most k · distc(u, v). We focus on spanners of directed graphs and a related notion of transitive-closure spanners. The latter captures the idea that a spanner should have a small diameter but preserve the connectivity of the original graph. We study the computational problem of finding the sparsest k-spanner (resp., k-TC-spanner) of a given directed graph, which we refer to as DIRECTED k-SPANNER (resp., k-TC-SPANNER). We improve all known approximation algorithms for DIRECTED k-SPANNER and k-TC-SPANNER for k ≥ 3. (For k = 2, the current ratios are tight, assuming P≠NP.) Along the way, we prove several structural results about the size of the sparsest spanners of directed graphs.

Original languageEnglish (US)
Title of host publication30th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010
Pages424-435
Number of pages12
Volume8
DOIs
StatePublished - Dec 1 2010
Event30th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010 - Chennai, India
Duration: Dec 15 2010Dec 18 2010

Other

Other30th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010
CountryIndia
CityChennai
Period12/15/1012/18/10

Fingerprint

Directed graphs
Approximation algorithms

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Berman, P., Raskhodnikova, S., & Ruan, G. (2010). Finding sparser directed spanners. In 30th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010 (Vol. 8, pp. 424-435) https://doi.org/10.4230/LIPIcs.FSTTCS.2010.424
Berman, Piotr ; Raskhodnikova, Sofya ; Ruan, Ge. / Finding sparser directed spanners. 30th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010. Vol. 8 2010. pp. 424-435
@inproceedings{46bb33e6e201462080740f8924be0dee,
title = "Finding sparser directed spanners",
abstract = "A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V,E H) is a k-spanner of a graph G = (V,E) if for every pair of vertices u, v ∈ V, the shortest path distance distH(u,v) from u to v in H is at most k · distc(u, v). We focus on spanners of directed graphs and a related notion of transitive-closure spanners. The latter captures the idea that a spanner should have a small diameter but preserve the connectivity of the original graph. We study the computational problem of finding the sparsest k-spanner (resp., k-TC-spanner) of a given directed graph, which we refer to as DIRECTED k-SPANNER (resp., k-TC-SPANNER). We improve all known approximation algorithms for DIRECTED k-SPANNER and k-TC-SPANNER for k ≥ 3. (For k = 2, the current ratios are tight, assuming P≠NP.) Along the way, we prove several structural results about the size of the sparsest spanners of directed graphs.",
author = "Piotr Berman and Sofya Raskhodnikova and Ge Ruan",
year = "2010",
month = "12",
day = "1",
doi = "10.4230/LIPIcs.FSTTCS.2010.424",
language = "English (US)",
isbn = "9783939897231",
volume = "8",
pages = "424--435",
booktitle = "30th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010",

}

Berman, P, Raskhodnikova, S & Ruan, G 2010, Finding sparser directed spanners. in 30th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010. vol. 8, pp. 424-435, 30th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, Chennai, India, 12/15/10. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.424

Finding sparser directed spanners. / Berman, Piotr; Raskhodnikova, Sofya; Ruan, Ge.

30th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010. Vol. 8 2010. p. 424-435.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Finding sparser directed spanners

AU - Berman, Piotr

AU - Raskhodnikova, Sofya

AU - Ruan, Ge

PY - 2010/12/1

Y1 - 2010/12/1

N2 - A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V,E H) is a k-spanner of a graph G = (V,E) if for every pair of vertices u, v ∈ V, the shortest path distance distH(u,v) from u to v in H is at most k · distc(u, v). We focus on spanners of directed graphs and a related notion of transitive-closure spanners. The latter captures the idea that a spanner should have a small diameter but preserve the connectivity of the original graph. We study the computational problem of finding the sparsest k-spanner (resp., k-TC-spanner) of a given directed graph, which we refer to as DIRECTED k-SPANNER (resp., k-TC-SPANNER). We improve all known approximation algorithms for DIRECTED k-SPANNER and k-TC-SPANNER for k ≥ 3. (For k = 2, the current ratios are tight, assuming P≠NP.) Along the way, we prove several structural results about the size of the sparsest spanners of directed graphs.

AB - A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V,E H) is a k-spanner of a graph G = (V,E) if for every pair of vertices u, v ∈ V, the shortest path distance distH(u,v) from u to v in H is at most k · distc(u, v). We focus on spanners of directed graphs and a related notion of transitive-closure spanners. The latter captures the idea that a spanner should have a small diameter but preserve the connectivity of the original graph. We study the computational problem of finding the sparsest k-spanner (resp., k-TC-spanner) of a given directed graph, which we refer to as DIRECTED k-SPANNER (resp., k-TC-SPANNER). We improve all known approximation algorithms for DIRECTED k-SPANNER and k-TC-SPANNER for k ≥ 3. (For k = 2, the current ratios are tight, assuming P≠NP.) Along the way, we prove several structural results about the size of the sparsest spanners of directed graphs.

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

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

U2 - 10.4230/LIPIcs.FSTTCS.2010.424

DO - 10.4230/LIPIcs.FSTTCS.2010.424

M3 - Conference contribution

AN - SCOPUS:84871542551

SN - 9783939897231

VL - 8

SP - 424

EP - 435

BT - 30th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010

ER -

Berman P, Raskhodnikova S, Ruan G. Finding sparser directed spanners. In 30th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010. Vol. 8. 2010. p. 424-435 https://doi.org/10.4230/LIPIcs.FSTTCS.2010.424