A better list heuristic for vertex cover

DOI10.1016/J.IPL.2008.02.004MaRDI QIDQ963417zbMATH OpenOpenAlexFDO

Authors François Delbot, Christian Laforest

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

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

Cites work

• A list heuristic for vertex cover
• Automata, Languages and Programming
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the hardness of approximating minimum vertex cover
• On-line vertex-covering

Cited in

(4)

• An articulation point-based approximation algorithm for minimum vertex cover problem
• A (2-)-approximation ratio for vertex cover problem on special graphs
• \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers
• Mean analysis of an online algorithm for the vertex cover problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963417)