The following pages link to (Q4948733):
Displaying 4 items.
- Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric (Q1037776) (← links)
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203) (← links)
- A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs (Q4557732) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
