Search Results - "Gamlath, Buddhima"

  • Showing 1 - 7 results of 7
Refine Results
  1. 1

    Online Matching with General Arrivals by Gamlath, Buddhima, Kapralov, Michael, Maggiori, Andreas, Svensson, Ola, Wajc, David

    “…The online matching problem was introduced by Karp, Vazirani and Vazirani nearly three decades ago. In that seminal work, they studied this problem in…”
    Get full text
    Conference Proceeding
  2. 2

    Approximating Star Cover Problems by Gamlath, Buddhima, Grinberg, Vadim

    Published 03-12-2019
    “…Given a metric space $(F \cup C, d)$, we consider star covers of $C$ with balanced loads. A star is a pair $(f, C_f)$ where $f \in F$ and $C_f \subseteq C$,…”
    Get full text
    Journal Article
  3. 3

    Nearly-Tight and Oblivious Algorithms for Explainable Clustering by Gamlath, Buddhima, Jia, Xinrui, Polak, Adam, Svensson, Ola

    Published 30-06-2021
    “…We study the problem of explainable clustering in the setting first formalized by Dasgupta, Frost, Moshkovitz, and Rashtchian (ICML 2020). A $k$-clustering is…”
    Get full text
    Journal Article
  4. 4

    Beating Greedy for Stochastic Bipartite Matching by Gamlath, Buddhima, Kale, Sagar, Svensson, Ola

    Published 14-10-2019
    “…We consider the maximum bipartite matching problem in stochastic settings, namely the query-commit and price-of-information models. In the query-commit model,…”
    Get full text
    Journal Article
  5. 5

    Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering by Gamlath, Buddhima, Huang, Sangxia, Svensson, Ola

    Published 02-03-2018
    “…We study $k$-means clustering in a semi-supervised setting. Given an oracle that returns whether two given points belong to the same cluster in a fixed optimal…”
    Get full text
    Journal Article
  6. 6

    Online Matching with General Arrivals by Gamlath, Buddhima, Kapralov, Michael, Maggiori, Andreas, Svensson, Ola, Wajc, David

    Published 17-04-2019
    “…The online matching problem was introduced by Karp, Vazirani and Vazirani nearly three decades ago. In that seminal work, they studied this problem in…”
    Get full text
    Journal Article
  7. 7

    Weighted Matchings via Unweighted Augmentations by Gamlath, Buddhima, Kale, Sagar, Mitrović, Slobodan, Svensson, Ola

    Published 06-11-2018
    “…We design a generic method for reducing the task of finding weighted matchings to that of finding short augmenting paths in unweighted graphs. This method…”
    Get full text
    Journal Article