Vladimir I. Khandeev. Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation. In Yaroslav D. Sergeyev, Dmitri E. Kvasov, editors, Numerical Computations: Theory and Algorithms - Third International Conference, NUMTA 2019, Crotone, Italy, June 15-21, 2019, Revised Selected Papers, Part II. Volume 11974 of Lecture Notes in Computer Science, pages 400-405, Springer, 2019. [doi]
Abstract is missing.