Standard

Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation. / Khandeev, Vladimir.

Numerical Computations: Theory and Algorithms - 3rd International Conference, NUMTA 2019, Revised Selected Papers. ed. / Yaroslav D. Sergeyev; Dmitri E. Kvasov. Springer Gabler, 2020. p. 400-405 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11974 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Khandeev, V 2020, Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation. in YD Sergeyev & DE Kvasov (eds), Numerical Computations: Theory and Algorithms - 3rd International Conference, NUMTA 2019, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11974 LNCS, Springer Gabler, pp. 400-405, 3rd Triennial International Conference and Summer School on Numerical Computations: Theory and Algorithms, NUMTA 2019, Crotone, Italy, 15.06.2019. https://doi.org/10.1007/978-3-030-40616-5_36

APA

Khandeev, V. (2020). Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation. In Y. D. Sergeyev, & D. E. Kvasov (Eds.), Numerical Computations: Theory and Algorithms - 3rd International Conference, NUMTA 2019, Revised Selected Papers (pp. 400-405). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11974 LNCS). Springer Gabler. https://doi.org/10.1007/978-3-030-40616-5_36

Vancouver

Khandeev V. Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation. In Sergeyev YD, Kvasov DE, editors, Numerical Computations: Theory and Algorithms - 3rd International Conference, NUMTA 2019, Revised Selected Papers. Springer Gabler. 2020. p. 400-405. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-40616-5_36

Author

Khandeev, Vladimir. / Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation. Numerical Computations: Theory and Algorithms - 3rd International Conference, NUMTA 2019, Revised Selected Papers. editor / Yaroslav D. Sergeyev ; Dmitri E. Kvasov. Springer Gabler, 2020. pp. 400-405 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{ef76ade927a5455e9723edfe7391a8b8,
title = "Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation",
abstract = "The paper is addressed to one strongly NP-hard problem of searching for the largest subset in the finite set of points in Euclidean space. A restriction is imposed on the searched subset: quadratic variation of its points with respect to the unknown centroid of this subset must not exceed a given value. We present the first polynomial-time approximation scheme for this problem.",
keywords = "Euclidean space, Largest subset, NP-hard problem, Polynomial-time approximation scheme, Quadratic variation",
author = "Vladimir Khandeev",
note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; 3rd Triennial International Conference and Summer School on Numerical Computations: Theory and Algorithms, NUMTA 2019 ; Conference date: 15-06-2019 Through 21-06-2019",
year = "2020",
month = jan,
day = "1",
doi = "10.1007/978-3-030-40616-5_36",
language = "English",
isbn = "9783030406158",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Gabler",
pages = "400--405",
editor = "Sergeyev, {Yaroslav D.} and Kvasov, {Dmitri E.}",
booktitle = "Numerical Computations",
address = "Germany",

}

RIS

TY - GEN

T1 - Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation

AU - Khandeev, Vladimir

N1 - Publisher Copyright: © 2020, Springer Nature Switzerland AG. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.

PY - 2020/1/1

Y1 - 2020/1/1

N2 - The paper is addressed to one strongly NP-hard problem of searching for the largest subset in the finite set of points in Euclidean space. A restriction is imposed on the searched subset: quadratic variation of its points with respect to the unknown centroid of this subset must not exceed a given value. We present the first polynomial-time approximation scheme for this problem.

AB - The paper is addressed to one strongly NP-hard problem of searching for the largest subset in the finite set of points in Euclidean space. A restriction is imposed on the searched subset: quadratic variation of its points with respect to the unknown centroid of this subset must not exceed a given value. We present the first polynomial-time approximation scheme for this problem.

KW - Euclidean space

KW - Largest subset

KW - NP-hard problem

KW - Polynomial-time approximation scheme

KW - Quadratic variation

UR - http://www.scopus.com/inward/record.url?scp=85080899125&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-40616-5_36

DO - 10.1007/978-3-030-40616-5_36

M3 - Conference contribution

AN - SCOPUS:85080899125

SN - 9783030406158

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 400

EP - 405

BT - Numerical Computations

A2 - Sergeyev, Yaroslav D.

A2 - Kvasov, Dmitri E.

PB - Springer Gabler

T2 - 3rd Triennial International Conference and Summer School on Numerical Computations: Theory and Algorithms, NUMTA 2019

Y2 - 15 June 2019 through 21 June 2019

ER -

ID: 23740693