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 profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-030-40616-5_36 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3006151793 / rank | |||
Normal rank | |||
Revision as of 00:50, 20 March 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
