research
∙
11/03/2022
A Round and Bipartize Approximation Algorithm for Vertex Cover
The vertex cover problem is a fundamental and widely studied combinatori...
share
research
∙
10/12/2022
A nearly optimal randomized algorithm for explorable heap selection
Explorable heap selection is the problem of selecting the nth smallest v...
research
∙
05/25/2021
