A better list heuristic for vertex cover

DOI10.1016/j.ipl.2008.02.004zbMath1186.68333OpenAlexW1991790827MaRDI QIDQ963417

Christian Laforest, François Delbot

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.02.004

zbMATH Keywords

analysis of algorithmsgraph algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem ⋮ Unnamed Item ⋮ Mean analysis of an online algorithm for the vertex cover problem ⋮ \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers

Cites Work

• Unnamed Item
• On the hardness of approximating minimum vertex cover
• On-line vertex-covering
• A list heuristic for vertex cover
• Automata, Languages and Programming

This page was built for publication: A better list heuristic for vertex cover