ON SPARSE SPANNERS OF WEIGHTED GRAPHS

被引：371

作者：

ALTHOFER, I

DAS, G

DOBKIN, D

JOSEPH, D

SOARES, J

机构：

[1] MEMPHIS STATE UNIV, DEPT MATH SCI, MEMPHIS, TN 38152 USA

[2] PRINCETON UNIV, DEPT COMP SCI, PRINCETON, NJ 08544 USA

[3] UNIV WISCONSIN, DEPT COMP SCI, MADISON, WI 53706 USA

[4] UNIV SAO PAULO, IME, MAC, BR-01498 SAO PAULO, BRAZIL

[5] UNIV CHICAGO, DEPT COMP SCI, CHICAGO, IL 60637 USA

来源：

DISCRETE & COMPUTATIONAL GEOMETRY | 1993年 / 9卷 / 01期

关键词：

D O I：

10.1007/BF02189308

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Given a graph G, a subgraph G' is a t-spanner of G if, for every u, v is-an-element-of V, the distance from u to v in G' is at most t times longer than the distance in G. In this paper we give a simple algorithm for constructing sparse spanners for arbitrary weighted graphs. We then apply this algorithm to obtain specific results for planar graphs and Euclidean graphs. We discuss the optimality of our results and present several nearly matching lower bounds.

引用

页码：81 / 100

页数：20

共 26 条

[1] ON OPTIMAL REALIZATIONS OF FINITE METRIC-SPACES BY GRAPHS [J].