Approximations for Steiner trees with minimum number of Steiner points

Theoretical Computer Science

Volumn 262, Issue 1-2, 2001, Pages 83-99

  Chen, Donghui ^e   Du, Ding Zhu ^a,b,c   Hu, Xiao Dong ^b,c   Lin, Guo Hui ^d   Wang, Lusheng ^b   Xue, Guoliang ^d  

^a University of Minnesota   (United States)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c INSTITUTE OF APPLIED MATHEMATICS   (China)

^d University of Vermont   (United States)

^e NONE

Author keywords

Approximation algorithms; Steiner trees; VLSI design; WDM optical networks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; VLSI CIRCUITS; WAVELENGTH DIVISION MULTIPLEXING; WIRELESS TELECOMMUNICATION SYSTEMS;

STEINER POINTS; STEINER TREES;

TREES (MATHEMATICS);

EID: 0034911862     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00182-1     Document Type: Article

References (17)

1. Polynomial time approximation schemes for Euclidean TSP and other geometric problems
2. A powerful global router: Based on Steiner min-max tree
3. A proof of Gilbert-Pollak's conjecture on the Steiner ratio
4. Approximation schemes for covering and packing problems in image processing and VLSI
5. Steiner tree problems
6. The Steiner minimum tree problems
7. The complexity of computing Steiner minimal trees
8. Minimum cost communication networks
9. Steiner minimal tree
10. New approximation algorithms for the Steiner tree problems
11. Gain equalization in metropolitan and wide area optical networks using optical amplifiers
12. Steiner tree problem with minimum number of Steiner points and bounded edge-length
13. Compression theorems and Steiner ratios on spheres
14. Minimizing the number of optical amplifiers needed to support a multi-wavelength optical LAN/MAN
15. On minimum cost network with nonlinear costs
16. An approximation scheme for some Steiner tree problems in the plane