21 citations found. Retrieving documents...
D.-Z. Du and F. K. Hwang.
A proof of the Gilbert-Pollak conjecture on the Steiner ratio
. Algorithmica, 7 (1992), 121-135.
Home/Search
Document Not in Database
Context
Related Articles
Check
This paper is cited by the following papers:
Euclidean Bounded-Degree Spanning Tree Ratios - Timothy Chan School (2003)
(3 citations)
(Correct)
Low Degree Spanning Trees of Small Weight - Khuller, RAGHAVACHARI, YOUNG (1996)
(19 citations)
(Correct)
On Spanning 2-Trees in a Graph - Cai (1996)
(Correct)
On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings - Fekete, Meijer (1999)
(Correct)
On Maximum Matchings and Minimum Stars - Fekete, Meijer (1998)
(Correct)
On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings - Fekete, Meijer (1999)
(Correct)
Steiner Minimal Trees: An Introduction, Parallel Computation.. - Harris, Jr. (1998)
(Correct)
An Adaptive Randomized Search for the Euclidean Steiner Tree Problem - So (1997)
(Correct)
Steiner Minimal Trees: Their Computational Past, Present, and.. - Harris, Jr.
(Correct)
Improved Approximation Schemes for Geometrical Graphs Via.. - Rao, Smith (1998)
(5 citations)
(Correct)
The Steiner Minimal Tree Problem in the λ-geometry Plane - Lee, Shen (1996)
(Correct)
Low Degree Spanning Trees Of Small Weight - Khuller, Raghavachari, Young (1996)
(19 citations)
(Correct)
A Stochastic Optimization Algorithm for Steiner Minimal Trees - Harris, Jr. (1994)
(Correct)
Approximating Geometrical Graphs Via Spanners and Banyans - Rao, Smith (1998)
(3 citations)
(Correct)
Geometric Interconnection and Placement Algorithms - Ganley (1995)
(3 citations)
(Correct)
Probabilistic Analysis of an Enhanced Partitioning Algorithm .. - Kalpakis, Sherman (1993)
(1 citation)
(Correct)
On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings - Fekete, Meijer (1999)
(Correct)
Wirelength Reduction by Using Diagonal Wire - Chiang, Su, Chiang (2003)
(Correct)
Euclidean Bounded-Degree Spanning Tree Ratios - Timothy Chan School (2003)
(3 citations)
(Correct)
Approximation Algorithms for the Class Steiner Tree Problem - Westbrook, Yan (1994)
(Correct)
Steiner Problem in Octilinear Routing Model - Kok (1995)
(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