Approximating subdense instances of covering problems (Q2840726)
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 6190259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating subdense instances of covering problems |
scientific article; zbMATH DE number 6190259 |
Statements
23 July 2013
0 references
approximation algorithms
0 references
subdense instances
0 references
graph covering
0 references
0 references
0 references
0.9435901
0 references
0.91798705
0 references
0.91798705
0 references
0 references
0.90959424
0 references
0.9093665
0 references
0.90841794
0 references
0.9068996
0 references
0.9047527
0 references
Approximating subdense instances of covering problems (English)
0 references
