Joachim Gudmundsson, Herman Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff  Home/Search
Context Related
| i11www.ira.uka.de/...pswflgmd02.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: i11www.ira.uka....pe=publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Let P be a set of n points in the plane. The geometric minimum-diameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a mono- or a dipolar MDST, i.e. a MDST with one or two nodes of degree greater 1, respectively. The more di#cult dipolar case can so far only be solved in slightly subcubic time. (Update)
Cited by: More
Farthest-Point Queries with Geometric and Combinatorial.. - Daescu, Mi, Shin, Wolff (2004) (Correct)
Similar documents (at the sentence level):
64.5%: Facility Location and the Geometric Minimum-Diameter .. - Gudmundsson.. (2003) (Correct)
49.1%: Approximating the Geometric Minimum-Diameter Spanning.. - Gudmundsson, Haverkort, .. (2002) (Correct)
Active bibliography (related documents): More All
0.2: A Fully Dynamic Algorithm for Planar Width - Chan (2002) (Correct)
0.2: Dynamic Subgraph Connectivity with Geometric Applications - Chan (2002) (Correct)
0.1: On Approximating the Radii of Point Sets in High Dimensions - Varadarajan, Venkatesh.. (2002) (Correct)
Similar documents based on text: More All
0.2: Constrained Higher Order Delaunay Triangulations - Gudmundsson, Haverkort, van.. (2004) (Correct)
0.2: Labeling Points with Weights - Poon, Shin, Strijk, Wolff (2001) (Correct)
0.1: Box-Trees and R-trees with Near-Optimal Query Time - Agarwal, de Berg.. (2001) (Correct)
Related documents from co-citation: More All
2: Polygonal path approximation: A query based approach (context) - Daescu, Mi - 2003
2: Polygonal path approximation with angle constraints - Chen, Daescu et al. - 2001
2: Approximate clustering via core-sets - Badoiu, Har-Peled et al. - 2002
BibTeX entry: (Update)
J. Gudmundsson, H. Haverkort, S.-M. Park, C.-S. Shin, and A. Wol#. Facility location and the geometric minimum-diameter spanning tree. In Proc. APPROX '02, vol. 2462 of LNCS, pages 146--160, 2002. Springer. http://citeseer.ist.psu.edu/gudmundsson02facility.html More
@misc{ gudmundsson02facility,
author = "J. Gudmundsson and H. Haverkort and S. Park and C. Shin and A. Wol",
title = "Facility location and the geometric minimum-diameter spanning tree",
text = "J. Gudmundsson, H. Haverkort, S.-M. Park, C.-S. Shin, and A. Wol#. Facility
location and the geometric minimum-diameter spanning tree. In Proc. APPROX
'02, vol. 2462 of LNCS, pages 146--160, 2002. Springer.",
year = "2002",
url = "citeseer.ist.psu.edu/gudmundsson02facility.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
106 A decomposition of multidimensional point sets with applicat.. - Callahan, Kosaraju - 1995
67 A data structuring technique (context) - Chazelle, Guibas - 1986
46 Dynamic half-space range reporting and its applications (context) - Agarwal, Matousek - 1995
20 The discrete 2-center problem - Agarwal, Sharir et al. - 1998
18 Minimum diameter spanning trees and related problems (context) - Ho, Lee et al. - 1991
15 smallest enclosing cylinder (context) - Chan, diameter - 2000
6 ciently approximating the minimum-volume bounding box of a p.. (context) - Barequet, Har-Peled - 1999
5 Semi-online maintenance of geometric optima and measures - Chan - 2002
3 approximate geometric minimum-diameter spanning tree (context) - Spriggs, Keil et al. - 2002
2 Approximating the geometric minimum-diameter spanning tree - Gudmundsson, Haverkort et al. - 2002
Documents on the same site (http://i11www.ira.uka.de/members/index.php?algouser=awolff&pagetype=publications): More
A Simple Factor-2/3 Approximation Algorithm For Two-Circle.. - Wolff, al. (2001) (Correct)
Labeling Points with Weights - Poon, Shin, Strijk, Wolff (2001) (Correct)
Three Rules Suffice for Good Label Placement - Wagner, Wolff, Kapoor, Strijk (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC