Approximating geometric bottleneck shortest paths
type: Item
instance of: scholarly article
title: Approximating geometric bottleneck shortest paths
zbMATH Open document ID: 1082.65015
author: Prosenjit Bose
author: Anil Maheshwari
author: Giri Narasimhan
author: Norbert Zeh
author: Michiel Smid
published in: Computational Geometry
publication date: 2004-11-18T00:00:00Z
review text: Consider a set \(S\) of \(n\) points in the plane. Given two points \(p\) and \(q\) in \(S\), and a real number \(L\), compute a shortest path between \(p\) and \(q\) in the graph with vertex set \(S\) and all edges of length at most \(L\). Some efficient algorithms are presented for this problem.
reviewed by: Du Ding-Zhu
Mathematics Subject Classification ID: 65D18
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 2116166
zbMATH Keywords: shortest path
zbMATH Keywords: algorithms
MaRDI profile type: Publication
full work available at URL: j.comgeo.2004.04.003
OpenAlex ID: W3021208656
cites work: Q4234097
cites work: Q4508365
cites work: Q4411362
cites work: An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
cites work: Introduction to algorithms
cites work: Q4947407
cites work: Q4945509
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: Classes of graphs which approximate the complete Euclidean graph
cites work: Q3150179
cites work: Q4945521
cites work: On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
DOI: 10.1016/J.COMGEO.2004.04.003
description: scientific article; zbMATH DE number 2116166