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]
@inproceedings{Khandeev19,
title = {Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation},
author = {Vladimir I. Khandeev},
year = {2019},
doi = {10.1007/978-3-030-40616-5_36},
url = {https://doi.org/10.1007/978-3-030-40616-5_36},
researchr = {https://researchr.org/publication/Khandeev19},
cites = {0},
citedby = {0},
pages = {400-405},
booktitle = {Numerical Computations: Theory and Algorithms - Third International Conference, NUMTA 2019, Crotone, Italy, June 15-21, 2019, Revised Selected Papers, Part II},
editor = {Yaroslav D. Sergeyev and Dmitri E. Kvasov},
volume = {11974},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-40616-5},
}