New Algorithms for k-Center and Extensions (Q5505644)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5498444
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New Algorithms for k-Center and Extensions |
scientific article; zbMATH DE number 5498444 |
Statements
New Algorithms for k-Center and Extensions (English)
0 references
27 January 2009
0 references
approximation algorithms
0 references
branch-and-bound
0 references
computational geometry
0 references
geometric inequalities
0 references
containment
0 references
core-sets
0 references
\(k\)-center
0 references
diameter partition
0 references
SOCP
0 references
2-SAT
0 references
0 references
0.9982109665870668
0 references
0.7797356247901917
0 references
0.7750072479248047
0 references
0.7638738751411438
0 references
0.7607645988464355
0 references
