Steiner Tree Problems in VLSI Layout Designs-Reference-Cited by-同舟云学术

Steiner Tree Problems in VLSI Layout Designs

Published:2001 Issue: Volume: Page:101-173
ISSN:1388-3011
Container-title:Combinatorial Optimization
language:
Short-container-title:

Author:

Cho Jun-Dong

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4613-0255-1_4.pdf

Reference60 articles.

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. “Network Flows”. Prentice Hall, Englewood Cliffs, New Jersey 07632, 1993.

2. P. Barth. “Generalized Integer Program:an implementation of an im-plicit enumeration algorithm solving linear 0–1 optimization problems”. http://www.ftp.mpi-sb.mpg.de:/pub/guide/staff/barth/opbdp.com , 1997.

3. P. Berman. “ http://www.berman@cse.psu.edu.com ”. private communication, May 1997.

4. H. A. Choi and A. H. Esfahanian. On complexity of a message-routing strategy for multicomputer systems. In the 16th International Workshop on Graph-Theoretic Concepts in Computer Science, Germany, pages 170–181, 1990.

5. J.D.Cho. “A Min-Cost Flow Based Min-Cost Rectilinear Steiner Distance-Preserving Tree Construction”. In In proceedings of 1997 IEEE/ACM International Symposium on Physical Design, pages 82–87, 1997.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Physarum-inspired approach to the Euclidean Steiner tree problem;Scientific Reports;2022-08-25

2. Solving Steiner trees: Recent advances, challenges, and perspectives;Networks;2020-11-27

3. A Population-based Local Search Technique with Random Descent and Jump for the Steiner Tree Problem in Graphs;Proceedings of the Genetic and Evolutionary Computation Conference 2016;2016-07-20