D.T. Lee, C. F. Shen  Home/Search
Context
Related
| nwu.edu/~dtlee/ISAAC96.ps.Z 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: nwu.edu/~dtlee/publication (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A Steiner Minimal Tree (SMT) for a given set P of points is a shortest network interconnecting the points of P whose vertex set may include some additional points in order to get the minimum possible total length in a metric space. When no additional points are allowed the minimum interconnection network is the well-known minimum spanning tree (MST) of P . The Steiner ratio is the greatest lower bound of the ratio of the length of an SMT over that of an MST of P . In this paper we study the... (Update)
Active bibliography (related documents): More All
0.8: Approximation Algorithms For Geometric Problems - Bern, Eppstein (1995) (Correct)
0.8: Steiner Tree Problems - Du, Lu, Ngo, Pardalos (2000) (Correct)
0.3: Geometric Shortest Paths and Network Optimization - Mitchell (1998) (Correct)
Similar documents based on text: More All
0.4: Vertex degrees of Steiner Minimal Trees in l_p and other smooth.. - Swanepoel (Correct)
0.4: Interconnection Strategies for Wireless Access Networks - Yanikomeroglu, Sousa (1997) (Correct)
0.3: Gaps in Convex Disc Packings with an Application to 1-Steiner.. - Swanepoel (2000) (Correct)
BibTeX entry: (Update)
@inproceedings{ lee96steiner,
author = "Lee and Shen",
title = "The Steiner Minimal Tree Problem in the lambda-geometry Plane",
booktitle = "{ISAAC}: 7th International Symposium on Algorithms and Computation (formerly {SIGAL} International Symposium on Algorithms), Organized by Special Interest Group on Algorithms ({SIGAL}) of the Information Processing Society of Japan ({IPSJ}) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers ({IEICE}))",
year = "1996",
url = "citeseer.ist.psu.edu/lee96steiner.html" }
Citations (may not include all citations):4212 Computers and Intractability: a Guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
66 On Steiner's Problem with Rectilinear Distance (context) - Hanan - 1966
48 The Complexity of Computing Steiner Minimal Trees (context) - Garey, Graham et al. - 1977
21 A Proof of the Gilbert-Pollak Conjecture on the Steiner Rati.. (context) - Du, Hwang - 1992
13 Hierarchical Steiner Tree Construction in Uniform Orientatio.. (context) - Sarrafzadeh, Wong - 1992
5 Minimum Steiner Trees in Normed Plane (context) - Du, Gao et al. - 1993
4 On Steiner Minimal Trees with Lp Distance (context) - Liu, Du - 1992
3 State of Art on Steiner Ratio Problems (context) - Du, Hwang - 1992
3 The Tight Lower Bound for the Steiner Ratio in Minkowski Pla.. (context) - Gao, Du et al. - 1994
1 Reducing the Steiner Problem in a Normed Space (context) - Du, Hwang - 1992
1 One Steiner Minimal Trees with Rectilinear Distance (context) - Hwang - 1976
1 On Steiner Tree Problem with 45 ffi Routing (context) - Lee, Shen et al. - 1995
Documents on the same site (http://web.eecs.nwu.edu/~dtlee/publication.html): More
On Crossing Minimization Problem - Chen, Lee (1998) (Correct)
An Optimal Algorithm for Shortest Paths on Weighted.. - Atallah, Chen, Lee (1995) (Correct)
Computational Geometry I - Lee (1996) (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