An exact algorithm for the uniformly-oriented steiner tree problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 760-772

  Nielsen, Benny K ^a   Winter, Pawel ^a   Zachariasen, Martin ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPUTATIONAL RESULTS; EUCLIDEAN STEINER TREE PROBLEMS; EXACT ALGORITHMS; OPTIMAL SOLUTIONS; PROBLEM INSTANCES; STEINER TREE PROBLEM; TWO-PHASE MODEL; UNIFORM ORIENTATION METRICS;

TREES (MATHEMATICS);

EID: 84938073927     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_66     Document Type: Conference Paper

References (18)

1. J. E. Beasley. OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society, 41:1069-1072, 1990. 768
2. M. Brazil. Steiner Minimum Trees in Uniform Orientation Metrics. In D.-Z. Du and X. Cheng, editor, Steiner Trees in Industries, pages 1-27. Kluwer Academic Publishers, 2001. 762
3. M. Brazil, D. A. Thomas, and J. F. Weng. Minimum Networks in Uniform Orientation Metrics. SIAM Journal on Computing, 30:1579-1593, 2000. 760, 762, 764
4. M. Brazil, D. A. Thomas, and J. F. Weng. Forbidden Subpaths for Steiner Minimum Networks in Uniform Orientation Metrics. Networks, 39:186-202, 2002. 760
5. M. Brazil, D. A. Thomas, J. F. Weng, and M. Zachariasen. Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics. In preparation. 761, 764, 765, 766
6. M. R. Garey and D.S. Johnson. The Rectilinear Steiner Tree Problem is NP-Complete. SIAM Journal on Applied Mathematics, 32(4):826-834, 1977. 760
7. F. K. Hwang, D. S. Richards, and P. Winter. The Steiner Tree Problem. Annals of Discrete Mathematics 53. Elsevier Science Publishers, Netherlands, 1992. 763
8. Y. Y. Li, S.K. Cheung, K. S. Leung, and C.K. Wong. Steiner Tree Constructions in A3-Metric. IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 45(5):563-574, 1998. 760
9. Y. Y. Li, K. S. Leung, and C. K. Wong. Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems. Journal of Combinatorial Optimization, 4:79-98, 2000. 760, 770
10. K. Mehlhorn and S. Naher. LEDA - A Platform for Combinatorial and Geometric Computing. Max-Planck-Institut für Informatik, Saarbrucken, Germany, http://www.mpi-sb.mpg.de/LEDA/leda.html, 1996. 768
11. B. K. Nielsen, P. Winter, and M. Zachariasen. On the Location of Steiner Points in Uniformly-Oriented Steiner Trees. Information Processing Letters, 83:237-241, 2002. 761
12. M. Sarrafzadeh and C. K. Wong. HierarchicalSteiner Tree Construction in Uniform Orientations. IEEE Transactions on Computer-Aided Design, 11:1095-1103, 1992. 760
13. D. M. Warme, P. Winter, and M. Zachariasen. Exact Algorithms for Plane Steiner Tree Problems: A Computational Study. In D.-Z. Du, J. M. Smith, and J. H. Rubinstein, editors, Advances in Steiner Trees, pages 81-116. Kluwer Academic Publishers, Boston, 2000. 761
14. D. M. Warme, P. Winter, and M. Zachariasen. GeoSteiner 3.1. Department of Computer Science, University of Copenhagen (DIKU)
15. http://www.diku.dk/geosteiner/, 2001. 761, 768, 770
16. P. Winter and M. Zachariasen. Euclidean Steiner Minimum Trees: An Improved Exact Algorithm. Networks, 30:149-166, 1997. 761
17. X Initiative Home Page, http://www.xinitiative.com, 2001. 760,768
18. M. Zachariasen. Rectilinear Full Steiner Tree Generation. Networks, 33:125-143, 1999. 761