A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A constant FPT approximation algorithm for hard-capacitated k-means |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A constant FPT approximation algorithm for hard-capacitated \(k\)-means |
scientific article |
Statements
A constant FPT approximation algorithm for hard-capacitated \(k\)-means (English)
0 references
18 January 2021
0 references
approximation algorithm
0 references
fixed-parameter tractable
0 references
\(k\)-means clustering
0 references
capacity constraints
0 references
0 references
0 references
0.8067125678062439
0 references
0.7832241058349609
0 references
0.7792115807533264
0 references
0.7760013937950134
0 references
0.7697301506996155
0 references
