The approximation algorithms for a class of multiple-choice problem (Q344788)
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 6655878
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The approximation algorithms for a class of multiple-choice problem |
scientific article; zbMATH DE number 6655878 |
Statements
The approximation algorithms for a class of multiple-choice problem (English)
0 references
24 November 2016
0 references
color-spanning objects
0 references
computational geometry
0 references
approximation algorithm
0 references
the smallest enclosing problem
0 references
0.8780096769332886
0 references
0.8448975086212158
0 references
0.8323476910591125
0 references
0.8178244233131409
0 references
0.8031424880027771
0 references
