np-hard-problems
Hvala: Approximate Vertex Cover Solver
Compute the Approximate Vertex Cover for undirected graph encoded in DIMACS format.
Compute the Approximate Independent Set for undirected graph encoded in DIMACS format.