A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem (Q3133212): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1982890 |
Changed an Item |
||
| Property / author | |||
| Property / author: Alexander Kel'Manov / rank | |||
Normal rank | |||
Revision as of 22:40, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem |
scientific article |
Statements
A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem (English)
0 references
13 February 2018
0 references
NP-hardness
0 references
Euclidian space
0 references
fixed dimension
0 references
FPTAS
0 references
