✦ LIBER ✦

A 2-approximation polynomial algorithm for a clustering problem

✍ Scribed by Kel’manov, A. V.; Khandeev, V. I.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Polynomial Approximation Algorithm for

✍ Natanzon, Assaf; Shamir, Ron; Sharan, Roded 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 179 KB

An approximating polynomial algorithm fo

✍ Kel’manov, A. V.; Khamidullin, S. A. 📂 Article 📅 2014 🏛 Pleiades Publishing 🌐 English ⚖ 512 KB

A fully polynomial approximation algorit

✍ M.J. Magazine; Osman Oguz 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 428 KB

A polynomial time approximation algorith

✍ Elke Eisenschmidt, Utz-Uwe Haus 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 305 KB

On a polynomial approximation problem

✍ Arthur A. Danielyan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 225 KB

A 2 +ɛapproximation algorithm for thek-M

✍ Sanjeev Arora; George Karakostas 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 177 KB