Pages that link to "Item:Q5936458"
From MaRDI portal
The following pages link to Lower bounds for computing geometric spanners and approximate shortest paths (Q5936458):
Displaying 11 items.
- A lower bound for computing geometric spanners (Q265718) (← links)
- On a family of strong geometric spanners that admit local routing strategies (Q551501) (← links)
- Geometric dilation of closed planar curves: New lower bounds (Q883237) (← links)
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Estimating the Held-Karp lower bound for the geometric TSP (Q1291588) (← links)
- Approximation algorithms for geometric shortest path problems (Q3191995) (← links)
- The Minimal Manhattan Network Problem in Three Dimensions (Q3605512) (← links)
- Lower bounds in on-line geometric searching metric searching (Q5055955) (← links)
- (Q5116490) (← links)
- Fundamentals of Computation Theory (Q5900801) (← links)
- Lower bounds in on-line geometric searching (Q5931368) (← links)