<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 1999-07-26 14:14:46Spanning tree NP-complete problems Euclidean minimum spanning tree Minimum spanning tree Delaunay triangulation Relative neighborhood graph Steiner tree problem Closest pair of points problem Planar graph Graph theory Theoretical computer science Mathematics |
| Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717DocID: 1qXBI - View Document |
| Kinetic Stable Delaunay Graphs Pankaj K. Agarwal Duke University Haim KaplanDocID: 1gmD0 - View Document |
| CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics∗ S¨oren Laue† AbstractDocID: 18Ex7 - View Document |
| CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli†DocID: 18dW2 - View Document |
| The min-# problem, a hybrid error criterion for near-linear time performance Lilian Buzer∗† Abstract 2.1DocID: 18dku - View Document |