Divide-and-Conquer Approximation Algorithm for Vertex Cover

DOI10.1137/070710275zbMath1210.68137OpenAlexW2075401051MaRDI QIDQ3583300

Eyjólfur Ingi Ásgeirsson, Clifford Stein

Publication date: 27 August 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070710275

zbMATH Keywords

approximation algorithmexperimentsheuristicvertex cover

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation ⋮ Vertex cover in conflict graphs

This page was built for publication: Divide-and-Conquer Approximation Algorithm for Vertex Cover