Fully Polynomial-Time Approximation Scheme for a Problem of Finding a Subsequence

Alexander Kelmanov, Sergey Khamidullin, Semyon Romanchenko. Fully Polynomial-Time Approximation Scheme for a Problem of Finding a Subsequence. In Alexandr Kononov, Igor Bykadorov, Oleg Khamisov, Ivan Davydov, Polina Kononova, editors, Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19 - 23, 2016. Volume 1623 of CEUR Workshop Proceedings, pages 516-525, CEUR-WS.org, 2016. [doi]

Abstract

Abstract is missing.