Some Results on Approximability of Minimum Sum Vertex Cover.

Aleksa Stankovic

Published in: CoRR (2022)

Keyphrases

vertex cover
approximation algorithms
polynomial time approximation
np hard
special case
worst case
minimum cost
precedence constraints
approximation ratio
error bounds
undirected graph
approximation guarantees
reinforcement learning
upper bound
greedy algorithm