✦ LIBER ✦

On the Construction of Optimal Obstacle-Avoiding Rectilinear Steiner Minimum Trees

✍ Scribed by Tao Huang; Liang Li; Young, E.F.Y.

Book ID: 117908538
Publisher: IEEE
Year: 2011
Tongue: English
Weight: 869 KB
Volume: 30
Category: Article
ISSN: 0278-0070
DOI: 10.1109/tcad.2010.2098930

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Obstacle-Avoiding Rectilinear Steiner Tr

Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

✍ Chung-Wei Lin; Szu-Yu Chen; Chi-Feng Li; Yao-Wen Chang; Chia-Lin Yang 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 923 KB

Obstacle-avoiding rectilinear Steiner tr

Obstacle-avoiding rectilinear Steiner tree construction in sequential and parallel approach

✍ Chow, Wing-Kai; Li, Liang; Young, Evangeline F.Y.; Sham, Chiu-Wing 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 977 KB

ObSteiner: An Exact Algorithm for the Co

ObSteiner: An Exact Algorithm for the Construction of Rectilinear Steiner Minimum Trees in the Presence of Complex Rectilinear Obstacles

✍ Huang, Tao (author);Young, Evangeline F.Y. (author) 📂 Article 📅 2013 🏛 IEEE 🌐 English ⚖ 506 KB

ObSteiner: An Exact Algorithm for the Co

ObSteiner: An Exact Algorithm for the Construction of Rectilinear Steiner Minimum Trees in the Presence of Complex Rectilinear Obstacles

✍ Huang, Tao (author);Young, Evangeline F.Y. (author) 📂 Article 📅 2013 🏛 IEEE 🌐 English ⚖ 506 KB

[IEEE 2011 Seventh International Confere

[IEEE 2011 Seventh International Conference on Natural Computation (ICNC) - Shanghai, China (2011.07.26-2011.07.28)] 2011 Seventh International Conference on Natural Computation - Obstacle-avoiding rectilinear Steiner minimum tree construction based on Discrete Particle Swarm Optimization

✍ Shen, Yulong; Liu, Qingzhen; Guo, Wenzhong 📂 Article 📅 2011 🏛 IEEE ⚖ 270 KB

Approximating the Minimum-Degree Steiner

Approximating the Minimum-Degree Steiner Tree to within One of Optimal

✍ M. Furer; B. Raghavachari 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 691 KB

The problem of constructing a spanning tree for a graph \(G=(V, E)\) with \(n\) vertices whose maximal degree is the smallest among all spanning trees of \(G\) is considered. This problem is easily shown to be NP-hard. In the Steiner version of this problem, along with the input graph, a set of dist