A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem (Q3133212): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Alexander Kel'Manov / rank | |||
| Property / author | |||
| Property / author: Alexander Kel'Manov / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_15 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2559584927 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:16, 19 March 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
