2 papers
cs.DS2026
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.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…