An articulation point-based approximation algorithm for minimum vertex cover problem

DOI10.1007/978-3-030-01120-8_32MaRDI QIDQ5038340zbMATH OpenOpenAlexFDO

Authors Jayanth Kumar Thenepalle, Purusotham Singamsetty

Publication date 30 September 2022

Published in Trends in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-01120-8_32

zbMATH Keywords

approximation algorithmminimum vertex cover problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 6303718
• New approximation algorithms for the vertex cover problem
• An approximation algorithm for the minimum weighted vertex-cover problem
• scientific article; zbMATH DE number 5631194
• An edge-reduction algorithm for the vertex cover problem

Cites work

• A better list heuristic for vertex cover
• A fixed-parameter algorithm for the vertex cover P₃ problem
• A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM
• A list heuristic for vertex cover
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Depth-first search and the vertex cover problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Improved upper bounds for vertex cover
• Introduction to algorithms.

This page was built for publication: An articulation point-based approximation algorithm for minimum vertex cover problem

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