A list heuristic for vertex cover
From MaRDI portal
Publication:2643795
DOI10.1016/j.orl.2006.03.014zbMath1125.05079MaRDI QIDQ2643795
Publication date: 27 August 2007
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2006.03.014
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
68W25: Approximation algorithms
05C07: Vertex degrees
Related Items
An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem, Unnamed Item, \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers, A better list heuristic for vertex cover, Mean analysis of an online algorithm for the vertex cover problem, Priority algorithms for graph optimization problems
Cites Work