Pages that link to "Item:Q3798263"
From MaRDI portal
The following pages link to Minimum Spanning Trees in <i>k</i>-Dimensional Space (Q3798263):
Displaying 33 items.
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
- A fast minimum spanning tree algorithm based on \(K\)-means (Q527132) (← links)
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454) (← links)
- Minimum spanning trees in \(d\) dimensions (Q826104) (← links)
- Well-separated pair decomposition in linear time? (Q963421) (← links)
- Region-fault tolerant geometric spanners (Q1016540) (← links)
- Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric (Q1037776) (← links)
- An O(N log N) minimal spanning tree algorithm for N points in the plane (Q1082081) (← links)
- On a proposed divide-and-conquer minimal spanning tree algorithm (Q1115202) (← links)
- Euclidean minimum spanning trees and bichromatic closest pairs (Q1176318) (← links)
- Minimal length tree networks on the unit sphere (Q1179757) (← links)
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310) (← links)
- Transitions in geometric minimum spanning trees (Q1199130) (← links)
- Fast geometric approximation techniques and geometric embedding problems (Q1202926) (← links)
- On the Steiner ratio in 3-space (Q1345879) (← links)
- On constructing minimum spanning trees in \(R_ 1^ k\) (Q1361418) (← links)
- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees (Q1386771) (← links)
- A sparse graph almost as good as the complete graph on points in \(k\) dimensions (Q1814131) (← links)
- An algorithm for geometric minimum spanning trees requiring nearly linear expected time (Q1824386) (← links)
- Approximate minimum weight matching on points in k-dimensional space (Q1825658) (← links)
- Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
- Minimal spanning trees and Stein's method (Q2403137) (← links)
- Approximating \(k\)-hop minimum-spanning trees (Q2488210) (← links)
- Spanning trees with low crossing number (Q3358265) (← links)
- (Q3743143) (← links)
- CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS (Q3986395) (← links)
- (Q4508378) (← links)
- A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs (Q4557732) (← links)
- (Q5033164) (← links)
- Dynamic smooth compressed quadtrees (Q5115813) (← links)
- The Filter-Kruskal Minimum Spanning Tree Algorithm (Q5233565) (← links)
- Structural Information and Communication Complexity (Q5710099) (← links)
- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees (Q6567757) (← links)
