Sparse distance preservers and additive spanners

Béla Bollobás; Don Coppersmith; Michael Elkin

Sparse distance preservers and additive spanners

Béla Bollobás, Don Coppersmith, Michael Elkin

Research output: Contribution to conference › Paper › peer-review

30 Scopus citations

Abstract

A notion of distance preserving approach, briefly, a preserver, is introduced. It is shown that any graph has a subgraph D-preserver with at most O(n²/D) edges, and there are graphs and diagraphs for which any undirected Steiner D-preserver contains Ω(n²/D) edges. However, it is illustrated that if one allows a directed Steiner D-preserver, then these bounds can be improved.

Original language	English
Pages	414-423
Number of pages	10
State	Published - 1 Jan 2003
Externally published	Yes
Event	Configuralble Computing: Technology and Applications - Boston, MA, United States Duration: 2 Nov 1998 → 3 Nov 1998

Conference

Conference	Configuralble Computing: Technology and Applications
Country/Territory	United States
City	Boston, MA
Period	2/11/98 → 3/11/98

ASJC Scopus subject areas

Software
Mathematics (all)

Cite this

@conference{b9e91b54f2bc49439b606104b5da40f4,

title = "Sparse distance preservers and additive spanners",

abstract = "A notion of distance preserving approach, briefly, a preserver, is introduced. It is shown that any graph has a subgraph D-preserver with at most O(n2/D) edges, and there are graphs and diagraphs for which any undirected Steiner D-preserver contains Ω(n2/D) edges. However, it is illustrated that if one allows a directed Steiner D-preserver, then these bounds can be improved.",

author = "B{\'e}la Bollob{\'a}s and Don Coppersmith and Michael Elkin",

year = "2003",

month = jan,

day = "1",

language = "English",

pages = "414--423",

note = "Configuralble Computing: Technology and Applications ; Conference date: 02-11-1998 Through 03-11-1998",

}

TY - CONF

T1 - Sparse distance preservers and additive spanners

AU - Bollobás, Béla

AU - Coppersmith, Don

AU - Elkin, Michael

PY - 2003/1/1

Y1 - 2003/1/1

N2 - A notion of distance preserving approach, briefly, a preserver, is introduced. It is shown that any graph has a subgraph D-preserver with at most O(n2/D) edges, and there are graphs and diagraphs for which any undirected Steiner D-preserver contains Ω(n2/D) edges. However, it is illustrated that if one allows a directed Steiner D-preserver, then these bounds can be improved.

AB - A notion of distance preserving approach, briefly, a preserver, is introduced. It is shown that any graph has a subgraph D-preserver with at most O(n2/D) edges, and there are graphs and diagraphs for which any undirected Steiner D-preserver contains Ω(n2/D) edges. However, it is illustrated that if one allows a directed Steiner D-preserver, then these bounds can be improved.

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

M3 - Paper

AN - SCOPUS:0037739977

SP - 414

EP - 423

T2 - Configuralble Computing: Technology and Applications

Y2 - 2 November 1998 through 3 November 1998

ER -

Sparse distance preservers and additive spanners

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this