A (1.999999)-approximation ratio for vertex cover problem.
Majid ZohrehbandianPublished in: CoRR (2024)
Keyphrases
- evolutionary algorithm
- vertex cover
- approximation ratio
- approximation algorithms
- np hard
- special case
- optimization problems
- worst case
- minimum cost
- polynomial time approximation
- undirected graph
- constant factor
- approximation guarantees
- lower bound
- scheduling problem
- upper bound
- greedy algorithm
- precedence constraints