A list heuristic for vertex cover
DOI10.1016/J.ORL.2006.03.014zbMATH Open1125.05079OpenAlexW2095553101MaRDI QIDQ2643795FDOQ2643795
Authors: Tomokazu Imamura, David Avis 
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
Recommendations
- On approximation of the vertex cover problem in hypergraphs
- scientific article; zbMATH DE number 3853131
- Analytical and experimental comparison of six algorithms for the vertex cover problem
- New approximation algorithms for the vertex cover problem
- Divide-and-conquer approximation algorithm for vertex cover
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (8)
- An articulation point-based approximation algorithm for minimum vertex cover problem
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP
- Title not available (Why is that?)
- Mean analysis of an online algorithm for the vertex cover problem
- \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers
- A better list heuristic for vertex cover
- A \((2-\varepsilon)\)-approximation ratio for vertex cover problem on special graphs
- Priority algorithms for graph optimization problems
This page was built for publication: A list heuristic for vertex cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643795)
