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 4 items.
- A lower bound for computing geometric spanners (Q265718) (← 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)
- The Minimal Manhattan Network Problem in Three Dimensions (Q3605512) (← links)
