scientific article; zbMATH DE number 7780067

DOI10.30495/jlta.2023.703516MaRDI QIDQ6179658

Majid Zohrehbandian, Unnamed Author, M. Maghasedi

Publication date: 18 December 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

discrete optimizationcomplexity theoryvertex cover problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
• An ant colony optimization algorithm for the minimum weight vertex cover problem
• On the hardness of approximating minimum vertex cover
• A better list heuristic for vertex cover
• Depth-first search and the vertex cover problem
• Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
• A list heuristic for vertex cover
• On the power of unique 2-prover 1-round games
• A Greedy Heuristic for the Set-Covering Problem
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM

This page was built for publication: