✦ LIBER ✦

The rectilinear steiner arborescence problem

✍ Scribed by Sailesh K. Rao; P. Sadayappan; Frank K. Hwang; Peter W. Shor

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

New approximations for the rectilinear S

✍ Ramnath, S. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 517 KB

Polynomial Time Approximation Scheme for

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

Reductions for the rectilinear steiner t

✍ Pawel Winter 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 842 KB

Probabilistic partitioning algorithms fo

✍ János Komlós; M. T. Shing 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 417 KB

The Rectilinear Steiner Tree Problem is

✍ Garey, M. R.; Johnson, D. S. 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 1013 KB