An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem

DOI10.1007/978-3-030-01120-8_32zbMath1501.90085OpenAlexW2914507485MaRDI QIDQ5038340

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• A fixed-parameter algorithm for the vertex cover \(P_3\) problem
• Improved upper bounds for vertex cover
• A better list heuristic for vertex cover
• Depth-first search and the vertex cover problem
• A list heuristic for vertex cover
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM

This page was built for publication: An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem