✦ LIBER ✦

On heuristics for minimum length rectilinear partitions

✍ Scribed by Dingzhu Du; Yanjun Zhang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for minimum length partitions

✍ Andrzej Lingas; Christos Levcopoulos; Jörg Sack 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 378 KB

On greedy heuristics for steiner minimum

✍ Ding -Zhu Du 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 249 KB

On better heuristics for Steiner minimum

✍ Ding-Zhu Du; Yanjun Zhang 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 519 KB

A tight worst case bound for the perform

✍ C. C. De Souza; C. C. Ribeiro 📂 Article 📅 1990 🏛 Springer 🌐 German ⚖ 234 KB

A Comparison of Heuristic Procedures for

✍ Michael J. Brusco; Douglas Steinley 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 262 KB

On the tour partitioning heuristic for t

✍ Herbert F. Lewis; Thomas R. Sexton 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 125 KB