Pages that link to "Item:Q1176318"
From MaRDI portal
The following pages link to Euclidean minimum spanning trees and bichromatic closest pairs (Q1176318):
Displaying 41 items.
- Minimizing interference in ad hoc networks with bounded communication radius (Q456109) (← links)
- Diameter, width, closest line pair, and parametric searching (Q685180) (← links)
- On ray shooting in convex polytopes (Q685183) (← links)
- Connected dominating sets on dynamic geometric graphs (Q691774) (← links)
- On the symmetric angle-restricted nearest neighbor problem (Q834915) (← links)
- Computing Euclidean maximum spanning trees (Q911288) (← links)
- Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric (Q1037776) (← links)
- Planar bichromatic minimum spanning trees (Q1044035) (← links)
- Cutting hyperplane arrangements (Q1176317) (← links)
- Euclidean minimum spanning trees and bichromatic closest pairs (Q1176318) (← links)
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310) (← links)
- Dynamic point location in arrangements of hyperplanes (Q1199133) (← links)
- Relative neighborhood graphs in three dimensions (Q1200909) (← links)
- On the Steiner ratio in 3-space (Q1345879) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- Kinetic \(k\)-semi-Yao graph and its applications (Q1622343) (← links)
- Bottleneck bichromatic full Steiner trees (Q1628678) (← links)
- Plane bichromatic trees of low degree (Q1650794) (← links)
- A new approach for the multiobjective minimum spanning tree (Q1651644) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- Computing depth orders for fat objects and related problems (Q1917032) (← links)
- Average case analysis of dynamic geometric optimization (Q1917043) (← links)
- Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
- On Some Proximity Problems of Colored Sets (Q2867120) (← links)
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem (Q3196382) (← links)
- A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs (Q4557732) (← links)
- The \(xyz\) algorithm for fast interaction search in high-dimensional data (Q4558182) (← links)
- Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree (Q4606658) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
- (Q5092465) (← links)
- (Q5121902) (← links)
- Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces (Q5136243) (← links)
- On the hardness of approximate and exact (bichromatic) maximum inner product (Q5140838) (← links)
- Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces (Q5234039) (← links)
- Planar Bichromatic Bottleneck Spanning Trees (Q5874461) (← links)
- Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\) (Q5961625) (← links)
- Dynamic connectivity in disk graphs (Q6145677) (← links)
- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees (Q6567757) (← links)
- On a traveling salesman problem for points in the unit cube (Q6614116) (← links)
