1 citations · 3 across the 5 of their papers we have counts for
5 papers · 1 filter
Improved Online Load Balancing in the Two-Norm
Sander Borst, Danish Kashaev
We study the online load balancing problem on unrelated machines, with the objective of minimizing the square of the norm of the loads on the machines. The greedy algorith…
Online Matching on -Uniform Hypergraphs
Sander Borst, Danish Kashaev, Zhuan Khye Koh
The online matching problem was introduced by Karp, Vazirani and Vazirani (STOC 1990) on bipartite graphs with vertex arrivals. It is well-known that the optimal competitive ratio…
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…
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…
A Simple Optimal Contention Resolution Scheme for Uniform Matroids
Danish Kashaev, Richard Santiago
Contention resolution schemes (or CR schemes), introduced by Chekuri, Vondrak and Zenklusen, are a class of randomized rounding algorithms for converting a fractional solution to a…