Joachim Gudmundsson, Herman Haverkort, Sang-Min Park, et al.  Home/Search
Context Related
| i11www.ira.uka.de/...pswagmds02.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 whose longest path consists of two or three edges, respectively. The more di#cult dipolar case can so far only be solved in O(n ) time. In this paper we give an O(n log n)-time approximation scheme for the MDST. (Update)
Cited by: More
Approximating the Geometric Minimum-Diameter Spanning Tree - Gudmundsson, Haverkort.. (2002) (Correct)
Facility Location and the Geometric Minimum-Diameter .. - Gudmundsson.. (2002) (Correct)
Active bibliography (related documents): More All
0.1: Design of Ovelay Networks for Internet Multicast - Shi (2002) (Correct)
0.1: Dimensioning Server Access Bandwidth and Multicast.. - Shi, Turner, Waldvogel (2001) (Correct)
0.1: Multicast Routing and Bandwidth Dimensioning in Overlay Networks - Shi, Turner (2002) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.1: Constrained Higher Order Delaunay Triangulations - Gudmundsson, Haverkort, van.. (2004) (Correct)
0.1: Optimal Spanners for Axis-Aligned Rectangles - Asano, de Berg, Cheong.. (2004) (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: Minimum diameter spanning trees and related problems (context) - Ho, Lee et al. - 1991
2: A decomposition of multi-dimensional point sets with applications to k-nearest-n.. - Callahan, Kosaraju - 1992
BibTeX entry: (Update)
J. Gudmundsson, H. Haverkort, S.-M. Park, C.-S. Shin, and A. Wol#. Approximating the geometric minimum-diameter spanning tree. Technical Report 4/2002. http://citeseer.ist.psu.edu/gudmundsson02approximating.html More
@misc{ gudmundsson02approximating,
author = "J. Gudmundsson and H. Haverkort and S. Park and C. Shin and A. Wol",
title = "Approximating the geometric minimum-diameter spanning tree",
text = "J. Gudmundsson, H. Haverkort, S.-M. Park, C.-S. Shin, and A. Wol#. Approximating
the geometric minimum-diameter spanning tree. Technical Report 4/2002.",
year = "2002",
url = "citeseer.ist.psu.edu/gudmundsson02approximating.html" }
Citations (may not include all citations):106 A decomposition of multidimensional point sets with applicat.. - Callahan, Kosaraju - 1995
18 Minimum diameter spanning trees and related problems (context) - Ho, Lee et al. - 1991
11 the minimum diameter spanning tree problem - Hassin, Tamir - 1995
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)
Facility Location and the Geometric Minimum-Diameter .. - Gudmundsson.. (2002) (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