Randomized and deterministic algorithms for geometric spanners of small diameter

Let S be a set of n points in IR/sup d/ and let t>1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q of points there is a path from p to q of length at most t times the Euclidean distance between p and p. Such a path is...

Full description

Bibliographic Details

Published in:	Foundations of Computer Science, 35th Symposium on (FOCS '94) pp. 703 - 712
Main Authors:	Arya, S., Mount, D.M., Smid, M.
Format:	Conference Proceeding
Language:	English
Published:	IEEE Comput. Soc. Press 1994
Subjects:	Computer science Contracts Data structures Euclidean distance Tree graphs
ISBN:	0818665807, 9780818665806
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!