A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM

DOI10.1142/S0217595906000905zbMath1113.90137OpenAlexW2025716666MaRDI QIDQ5483436

Alok Singh, Ashok Kumar Gupta

Publication date: 14 August 2006

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595906000905

zbMATH Keywords

combinatorial optimizationminimum weight vertex covergreedy heuristicsteady-state genetic algorithm

Mathematics Subject Classification ID

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

Related Items (4)

An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem ⋮ Multi-start iterated tabu search for the minimum weight vertex cover problem ⋮ Towards faster local search for minimum weight vertex cover on massive graphs ⋮ Unnamed Item

Cites Work

• An improved fixed-parameter algorithm for vertex cover
• An ant colony optimization algorithm for the minimum weight vertex cover problem
• Ramsey numbers and an approximation algorithm for the vertex cover problem
• A Greedy Heuristic for the Set-Covering Problem
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Some optimal inapproximability results
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM