✦ LIBER ✦

New approximations for the rectilinear Steiner arborescence problem [VLSI layout]

✍ Scribed by Ramnath, S.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial Time Approximation Scheme for

✍ Bing Lu; Lu Ruan 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 41 KB

Polynomial Time Approximation Scheme for

✍ Xiuzhen Cheng; Bhaskar DasGupta; Bing Lu 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 291 KB

Optimum partitioning problem for rectili

✍ Ku, L.-P.; Leong, H.W. 📂 Article 📅 1997 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 954 KB

Faster Approximation Algorithms for the

✍ U. Fößmeier; M. Kaufmann; A. Zelikovsky 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 217 KB

New algorithms for the rectilinear Stein

✍ Ho, J.-M.; Vijayan, G.; Wong, C.K. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 1000 KB

Efficient algorithms for the minimum sho

✍ Cong, J.; Kahng, A.B.; Kwok-Shing Leung 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 553 KB