Approximating Euclidean distances by small degree graphs
type: Item
instance of: scholarly article
title: Approximating Euclidean distances by small degree graphs
zbMATH Open document ID: 0790.51010
DOI: 10.1007/BF02574005
author: V. Pereyra
published in: Discrete \& Computational Geometry
publication date: 1994-06-26T00:00:00Z
full work available at URL: https://eudml.org/doc/131299
Mathematics Subject Classification ID: 51K05
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 536876
zbMATH Keywords: approximating Euclidean distances
zbMATH Keywords: bounded degree spanners
MaRDI profile type: Publication
cites work: Generating sparse spanners for weighted graphs
cites work: On sparse spanners of weighted graphs
cites work: Q4039784
cites work: Delaunay graphs are almost as good as complete graphs
cites work: Q3802644
cites work: Classes of graphs which approximate the complete Euclidean graph
cites work: Q3484376
cites work: Graph spanners
cites work: The Closest Packing of Spherical Caps in n Dimensions
cites work: An O(n log n) algorithm for the all-nearest-neighbors problem
cites work: A sparse graph almost as good as the complete graph on points in \(k\) dimensions
description: scientific article; zbMATH DE number 536876