Pages that link to "Item:Q1886239"
From MaRDI portal
The following pages link to Approximating geometric bottleneck shortest paths (Q1886239):
Displaying 25 items.
- On plane geometric spanners: a survey and open problems (Q359741) (← links)
- On bounded degree plane strong geometric spanners (Q450575) (← links)
- On a family of strong geometric spanners that admit local routing strategies (Q551501) (← links)
- On bounded leg shortest paths problems (Q633848) (← links)
- Bottleneck detour tree of points on a path (Q670710) (← links)
- Bottleneck shortest paths on a partially ordered scale (Q1416100) (← links)
- Continuous Yao graphs (Q1693326) (← links)
- Shortest path geometric rounding (Q1977118) (← links)
- On the restricted 1-Steiner tree problem (Q2019490) (← links)
- On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
- The \(\varTheta_5\)-graph is a spanner (Q2261580) (← links)
- Shortest paths in intersection graphs of unit disks (Q2344058) (← links)
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579) (← links)
- Building Cartesian trees from free trees with \(k\) leaves (Q2450934) (← links)
- Efficient computation of geodesic shortest paths (Q2819608) (← links)
- YAO GRAPHS SPAN THETA GRAPHS (Q3166731) (← links)
- Approximation algorithms for geometric shortest path problems (Q3191995) (← links)
- DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE (Q3636312) (← links)
- π/2-ANGLE YAO GRAPHS ARE SPANNERS (Q4650091) (← links)
- Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time (Q5002715) (← links)
- (Q5115792) (← links)
- Odd Yao-Yao Graphs are Not Spanners (Q5115817) (← links)
- Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints (Q5197491) (← links)
- Geometric <i>k</i> Shortest Paths (Q5363016) (← links)
- Fundamentals of Computation Theory (Q5900801) (← links)
