16 citations · 28 across the 3 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019
Approximating Star Cover Problems
Buddhima Gamlath, Vadim Grinberg
Given a metric space , we consider star covers of with balanced loads. A star is a pair where and , and the load of a star…
cs.DS2019★ 16 cited
Beating Greedy for Stochastic Bipartite Matching
Buddhima Gamlath, Sagar Kale, Ola Svensson
We consider the maximum bipartite matching problem in stochastic settings, namely the query-commit and price-of-information models. In the query-commit model, an edge e independent…
cs.DS2019
Online Matching with General Arrivals
Buddhima Gamlath, Michael Kapralov, Andreas Maggiori +2
The online matching problem was introduced by Karp, Vazirani and Vazirani nearly three decades ago. In that seminal work, they studied this problem in bipartite graphs with vertice…