1 citations · 3 across the 5 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
Round and Bipartize for Vertex Cover Approximation
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…
cs.DS2022★ 1 cited
A nearly optimal randomized algorithm for explorable heap selection
Sander Borst, Daniel Dadush, Sophie Huiberts +1
Explorable heap selection is the problem of selecting the th smallest value in a binary heap. The key values can only be accessed by traversing through the underlying infinite b…