3 citations · 3 across the 3 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
The Min-Cost Matching with Concave Delays Problem
Yossi Azar, Runtian Ren, Danny Vainstein
We consider the problem of online min-cost perfect matching with concave delays. We begin with the single location variant. Specifically, requests arrive in an online fashion at a…
cs.DS2020★ 3 cited
Hierarchical Clustering: a 0.585 Revenue Approximation
Noga Alon, Yossi Azar, Danny Vainstein
Hierarchical Clustering trees have been widely accepted as a useful form of clustering data, resulting in a prevalence of adopting fields including phylogenetics, image analysis, b…