Approximation algorithms for a geometric set cover problem (Q423912)
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: Approximation algorithms for a geometric set cover problem |
scientific article; zbMATH DE number 6039473
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for a geometric set cover problem |
scientific article; zbMATH DE number 6039473 |
Statements
Approximation algorithms for a geometric set cover problem (English)
0 references
30 May 2012
0 references
guarding set of segments
0 references
art-gallery problem
0 references
approximation algorithm
0 references
set cover
0 references
vertex cover
0 references
0.8420276641845703
0 references
0.8387464284896851
0 references
0.8301008343696594
0 references
0.7885586619377136
0 references
