✦ LIBER ✦

Approximation algorithms for some intractable problems of choosing a vector subsequence

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

NP-completeness of some problems of choo

✍ A. V. Kel’manov; A. V. Pyatkin 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 431 KB

On-Line and Off-Line Approximation Algor

✍ Alon, N.; Azar, Y.; Csirik, J.; Epstein, L.; Sevastianov, S. V.; Vestjens, A. P. 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 151 KB

An approximation algorithm for solving a

✍ A. V. Kel’manov; S. M. Romanchenko 📂 Article 📅 2012 🏛 Pleiades Publishing 🌐 English ⚖ 452 KB

A fast and practical bit-vector algorith

✍ Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzon; James F. Reid 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Methods of choosing the first approximat

✍ Ya.A. Uzakov 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 616 KB

Some properties of approximate solutions

✍ Qiusheng Qiu; Xinmin Yang 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 180 KB