Preserving approximation in the min-weighted set cover problem (Q674914): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A linear-time approximation algorithm for the weighted vertex cover problem / 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: Q4228484 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank | |||
Normal rank | |||
Revision as of 10:38, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Preserving approximation in the min-weighted set cover problem |
scientific article |
Statements
Preserving approximation in the min-weighted set cover problem (English)
0 references
30 June 1997
0 references
min-weighted set cover problem
0 references
Chvatal's algorithm
0 references
