✦ LIBER ✦

An approximating polynomial algorithm for a sequence partitioning problem

✍ Scribed by Kel’manov, A. V.; Khamidullin, S. A.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximate algorithms for partitioning

✍ Mohammad Ashraf Iqbal 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 999 KB

A Polynomial Time Algorithm for Shaped P

✍ Hwang, Frank K.; Onn, Shmuel; Rothblum, Uriel G. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 343 KB

A Polynomial Quantum Algorithm for Appro

✍ Dorit Aharonov; Vaughan Jones; Zeph Landau 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 576 KB

A 2-approximation polynomial algorithm f

✍ Kel’manov, A. V.; Khandeev, V. I. 📂 Article 📅 2013 🏛 Pleiades Publishing 🌐 English ⚖ 458 KB

Approximation algorithms for(k)-partitio

✍ Weidong Li, Jianping Li 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 174 KB

An approximating algorithm for an optimu

✍ Sidney I. Firstman 📂 Article 📅 1960 🏛 John Wiley and Sons 🌐 English ⚖ 827 KB