Pages that link to "Item:Q1194310"
From MaRDI portal
The following pages link to Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310):
Displaying 18 items.
- Group nearest-neighbor queries in the \(L_1\) plane (Q500965) (← links)
- An almost space-optimal streaming algorithm for coresets in fixed dimensions (Q547286) (← links)
- On the longest spanning tree with neighborhoods (Q777263) (← links)
- Packing two disks into a polygonal environment. (Q878013) (← links)
- Relative neighborhood graphs in three dimensions (Q1200909) (← links)
- Computing farthest neighbors on a convex polytope. (Q1401257) (← links)
- Computing Euclidean bottleneck matchings in higher dimensions (Q1607062) (← links)
- Streaming algorithms for extent problems in high dimensions (Q2345940) (← links)
- Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)
- Faster core-set constructions and data-stream algorithms in fixed dimensions (Q2507158) (← links)
- On Some Proximity Problems of Colored Sets (Q2867120) (← links)
- Finding Largest Well-Predicted Subset of Protein Structure Models (Q3506941) (← links)
- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions (Q3541136) (← links)
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS (Q4818546) (← links)
- (Q5009560) (← links)
- GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS (Q5470168) (← links)
- Communication costs in a geometric communication network (Q6052702) (← links)
- Computing fair and bottleneck matchings in geometric graphs (Q6487431) (← links)
