3 citations · 8 across the 10 of their papers we have counts for
1 paper · 1 filter
Danish Kashaev, Guido Schäfer
The vertex cover problem is a fundamental and widely studied combinatorial optimization problem. It is known that its standard linear programming relaxation is integral for biparti…