A simple LP-free approximation algorithm for the minimum weight vertex cover problem (Q673599): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
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: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient bounds for the stable set, vertex cover and set packing problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ramsey numbers and an approximation algorithm for the vertex cover problem / rank | |||
Normal rank | |||
Latest revision as of 11:26, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple LP-free approximation algorithm for the minimum weight vertex cover problem |
scientific article |
Statements
A simple LP-free approximation algorithm for the minimum weight vertex cover problem (English)
0 references
28 February 1997
0 references
Approximation algorithms
0 references
Analysis of algorithms
0 references
