A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113)
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 7495410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A technique for obtaining true approximations for \(k\)-center with covering constraints |
scientific article; zbMATH DE number 7495410 |
Statements
A technique for obtaining true approximations for \(k\)-center with covering constraints (English)
0 references
22 March 2022
0 references
approximation algorithms
0 references
\(k\)-center
0 references
clustering
0 references
polyhedral techniques
0 references
0 references
1.0000001
0 references
0 references
0.8969875
0 references
0 references
0.89451236
0 references
0.8816188
0 references
0.8806052
0 references
0.8776023
0 references
