Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers (Q2963918)
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: Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers |
scientific article |
Statements
21 February 2017
0 references
approximation algorithms
0 references
set cover problem
0 references
tree cover
0 references
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers (English)
0 references
0.89949095
0 references
0.89639056
0 references
0.8898022
0 references
0.87980306
0 references
0.87980306
0 references
0.87980276
0 references
0.87971735
0 references
0.87481594
0 references
