1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.DS2026★ 1 cited
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…
cs.GT2025
Selfish, Local and Online Scheduling via Vector Fitting
Danish Kashaev
We provide a dual fitting technique on a semidefinite program yielding simple proofs of tight bounds for the robust price of anarchy of several congestion and scheduling games unde…
cs.DS2025
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…