New algorithms for \(k\)-center and extensions (Q849133)
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 5674588
| 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 5674588 |
Statements
New algorithms for \(k\)-center and extensions (English)
0 references
24 February 2010
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
diameter partition
0 references
SOCP
0 references
2-SAT
0 references
0 references
0.99999994
0 references
0.8803396
0 references
0.8784558
0 references
0.8756815
0 references
0.86831045
0 references
0.8658419
0 references
