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

DOI10.1007/978-3-030-40616-5_36OpenAlexW3006151793MaRDI QIDQ5122318

Vladimir Khandeev

Publication date: 22 September 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-40616-5_36

zbMATH Keywords

Euclidean spacequadratic variationNP-hard problempolynomial-time approximation schemelargest subset

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites Work

• Solving some vector subset problems by Voronoi diagrams
• Finding k points with minimum diameter and related problems
• An Introduction to Statistical Learning
• Robust Methods for Data Reduction
• Data Mining
• An approximation scheme for a problem of search for a vector subset

This page was built for publication: Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation