11 citations · 66 across the 33 of their papers we have counts for
21 papers · 1 filter
Embeddings of Planar Quasimetrics into Directed \ell_1$ and Polylogarithmic Approximation for Directed Sparsest-Cut
Ken-ichi Kawarabayashi, Anastasios Sidiropoulos
The multi-commodity flow-cut gap is a fundamental parameter that affects the performance of several divide \& conquer algorithms, and has been extensively studied for various class…
Learning Lines with Ordinal Constraints
Bohan Fan, Diego Ihara Centurion, Neshat Mohammadi +3
We study the problem of finding a mapping from a set of points into the real line, under ordinal triple constraints. An ordinal constraint for a triple of points asse…
Computing Bi-Lipschitz Outlier Embeddings into the Line
Karine Chubarian, Anastasios Sidiropoulos
The problem of computing a bi-Lipschitz embedding of a graphical metric into the line with minimum distortion has received a lot of attention. The best-known approximation algorith…
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families
Brian Axelrod, Ilias Diakonikolas, Anastasios Sidiropoulos +2
We consider the problem of computing the maximum likelihood multivariate log-concave distribution for a set of points. Specifically, we present an algorithm which, given points…
A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities
Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart
We study the problem of computing the maximum likelihood estimator (MLE) of multivariate log-concave densities. Our main result is the first computationally efficient algorithm for…
Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion
Timothy Carpenter, Ario Salmasi, Anastasios Sidiropoulos
The problem of routing in graphs using node-disjoint paths has received a lot of attention and a polylogarithmic approximation algorithm with constant congestion is known for undir…