Approximation algorithms for minimum weight partial connected set cover problem (Q5963645)
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 minimum weight partial connected set cover problem |
scientific article; zbMATH DE number 6544333
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for minimum weight partial connected set cover problem |
scientific article; zbMATH DE number 6544333 |
Statements
Approximation algorithms for minimum weight partial connected set cover problem (English)
0 references
23 February 2016
0 references
set cover
0 references
greedy algorithm
0 references
approximation algorithm
0 references
submodular function
0 references
0 references
0 references
0.9336057901382446
0 references
0.8347505331039429
0 references
0.8199636340141296
0 references
0.8186971545219421
0 references
