Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation (Q5122318): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Data Mining / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Robust Methods for Data Reduction / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Introduction to Statistical Learning / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding k points with minimum diameter and related problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving some vector subset problems by Voronoi diagrams / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An approximation scheme for a problem of search for a vector subset / rank | |||
Normal rank | |||
Latest revision as of 16:36, 23 July 2024
scientific article; zbMATH DE number 7250774
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation |
scientific article; zbMATH DE number 7250774 |
Statements
Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation (English)
0 references
22 September 2020
0 references
Euclidean space
0 references
largest subset
0 references
quadratic variation
0 references
NP-hard problem
0 references
polynomial-time approximation scheme
0 references
