2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence (Q5122316)
From MaRDI portal
scientific article; zbMATH DE number 7250772
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence |
scientific article; zbMATH DE number 7250772 |
Statements
2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence (English)
0 references
22 September 2020
0 references
Euclidean space
0 references
sequence of points
0 references
weighted 2-partition
0 references
quadratic variation
0 references
NP-hard problem
0 references
approximation algorithm
0 references
polynomial time
0 references
0 references
0 references
0 references
