3 citations · 3 across the 3 of their papers we have counts for
6 papers
Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering
Yossi Azar, Danny Vainstein
We present a new multi-layer peeling technique to cluster points in a metric space. A well-known non-parametric objective is to embed the metric space into a simpler structured met…
List Update with Delays or Time Windows
Yossi Azar, Shahar Lewkowicz, Danny Vainstein
We consider the problem of List Update, one of the most fundamental problems in online algorithms. We are given a list of elements and requests for these elements that arrive over…
Tree Learning: Optimal Algorithms and Sample Complexity
Dmitrii Avdiukhin, Grigory Yaroslavtsev, Danny Vainstein +3
We study the problem of learning a hierarchical tree representation of data from labeled samples, taken from an arbitrary (and possibly adversarial) distribution. Consider a collec…
Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering
Danny Vainstein, Vaggos Chatziafratis, Gui Citovsky +3
Recently, Hierarchical Clustering (HC) has been considered through the lens of optimization. In particular, two maximization objectives have been defined. Moseley and Wang defined…
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…
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…