Approximating geometric bottleneck shortest paths
DOI10.1016/J.COMGEO.2004.04.003zbMATH Open1082.65015OpenAlexW3021208656MaRDI QIDQ1886239FDOQ1886239
Authors: Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Norbert Zeh, Michiel Smid 
Publication date: 18 November 2004
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.04.003
Recommendations
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Fast Algorithms for Finding Nearest Common Ancestors
- Title not available (Why is that?)
- Classes of graphs which approximate the complete Euclidean graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs
- Title not available (Why is that?)
Cited In (29)
- \(\pi /2\)-angle Xao graphs are spanners
- On a family of strong geometric spanners that admit local routing strategies
- Shortest paths in intersection graphs of unit disks
- Building Cartesian trees from free trees with \(k\) leaves
- Bottleneck shortest paths on a partially ordered scale
- Shortest path geometric rounding
- On the restricted 1-Steiner tree problem
- On the restricted \(k\)-Steiner tree problem
- The \(\varTheta_5\)-graph is a spanner
- DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE
- Approximating all-pair bounded-leg shortest path and APSP-AF in truly-subcubic time
- Spanning properties of Yao and \(\theta\)-graphs in the presence of constraints
- Odd Yao-Yao graphs are not spanners
- Geometric k Shortest Paths
- On bounded leg shortest paths problems
- On reverse shortest paths in geometric proximity graphs
- On plane geometric spanners: a survey and open problems
- Efficient computation of geodesic shortest paths
- On bounded degree plane strong geometric spanners
- Continuous Yao graphs
- On bounded leg shortest paths problems
- Yao graphs span theta graphs
- Approximation algorithms for geometric shortest path problems
- Title not available (Why is that?)
- Bottleneck detour tree of points on a path
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fundamentals of Computation Theory
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
This page was built for publication: Approximating geometric bottleneck shortest paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1886239)
