✦ LIBER ✦

Spanning graph-based nonrectilinear steiner tree algorithms

✍ Scribed by Qi Zhu; Hai Zhou; Tong Jing; Hong, X.-L.; Yang Yang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Steiner tree construction base

✍ Hai Zhou 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 357 KB

Obstacle-Avoiding Rectilinear Steiner Tr

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

Rectilinear steiner tree heuristics and

✍ Y. C. Wee; S. Chaiken; S. S. Ravi 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 899 KB

The competitiveness of randomized algori

✍ Ying Teh Tsai; Chuan Yi Tang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 373 KB

Parallel algorithms for minimal spanning

✍ Yixin Zhang 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 570 KB

A faster approximation algorithm for the

✍ Alexander Z. Zelikovsky 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 369 KB