7 citations · 16 across the 30 of their papers we have counts for
4 papers · 1 filter
Stochastic Embedding of Digraphs into DAGs
Arnold Filtser
Given a weighted digraph , a stochastic embedding into DAGs is a distribution over pairs of DAGs such that for every : (1) the reachabilit…
The Squishy Grid Problem
Zixi Cai, Kuowen Chen, Shengquan Du +3
In this paper we consider the problem of approximating Euclidean distances by the infinite integer grid graph. Although the topology of the graph is fixed, we have control over the…
How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs
Jonathan Conroy, Arnold Filtser
Roughly, a metric space has padding parameter if for every , there is a stochastic decomposition of the metric points into clusters of diameter at most such that every…
Faster Approximation Algorithms for k-Center via Data Reduction
Arnold Filtser, Shaofeng H. -C. Jiang, Yi Li +4
We study efficient algorithms for the Euclidean -Center problem, focusing on the regime of large . We take the approach of data reduction by considering -coreset, which is…