2 citations · 3 across the 9 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Optimal Analysis of Greedy for Stochastic Online Euclidean Matching
Mingwei Yang, Sophie H. Yu
We study Greedy for online metric matching with servers and requests sampled independently and uniformly from . Servers are available initially, and Greedy irrevoc…
cs.DS2024
Online Metric Matching: Beyond the Worst Case
Mingwei Yang, Sophie H. Yu
We study the online metric matching problem. There are servers and requests located in a metric space, where all servers are available upfront and requests arrive one at a…
cs.DS2022
Streaming Facility Location in High Dimension via Geometric Hashing
Artur Czumaj, Arnold Filtser, Shaofeng H. -C. Jiang +3
In Euclidean Uniform Facility Location (UFL), the input is a set of clients in and the goal is to place facilities to serve them, so as to minimize the total cost of…