On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776)
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: On the approximability and hardness of minimum topic connected overlay and its special instances |
scientific article; zbMATH DE number 6039170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the approximability and hardness of minimum topic connected overlay and its special instances |
scientific article; zbMATH DE number 6039170 |
Statements
On the approximability and hardness of minimum topic connected overlay and its special instances (English)
0 references
30 May 2012
0 references
topic-connected overlay
0 references
approximation algorithm
0 references
APX
0 references
hardness
0 references
0 references
0.9922155141830444
0 references
0.8591118454933167
0 references
0.718533456325531
0 references
0.7160433530807495
0 references
0.7139154672622681
0 references
