Vertex Cover Approximations on Random Graphs
From MaRDI portal
Publication:5432321
DOI10.1007/978-3-540-72845-0_22zbMath1203.68313OpenAlexW1598320652MaRDI QIDQ5432321
Eyjólfur Ingi Ásgeirsson, Clifford Stein
Publication date: 2 January 2008
Published in: Experimental Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72845-0_22
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
An edge-reduction algorithm for the vertex cover problem ⋮ A novel parameterised approximation algorithm for \textsc{minimum vertex cover} ⋮ Strong and weak edges of a graph and linkages with the vertex cover problem
This page was built for publication: Vertex Cover Approximations on Random Graphs