Complexity and approximation of the connected set-cover problem (Q453623): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Connected Set Cover Problem and Its Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polylogarithmic inapproximability / rank | |||
Normal rank | |||
Revision as of 17:10, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and approximation of the connected set-cover problem |
scientific article |
Statements
Complexity and approximation of the connected set-cover problem (English)
0 references
27 September 2012
0 references
connected set-cover
0 references
computational complexity
0 references
approximation algorithms
0 references
