6 citations · 14 across the 22 of their papers we have counts for
5 papers · 1 filter
Parameterized Approximation Algorithms for -Center Clustering and Variants
Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi
-center is one of the most popular clustering models. While it admits a simple 2-approximation in polynomial time in general metrics, the Euclidean version is NP-hard to approxi…
Improved Approximations for CVRP with Unsplittable Demands
Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay +1
In this paper, we present improved approximation algorithms for the (unsplittable) Capacitated Vehicle Routing Problem (CVRP) in general metrics. In CVRP, introduced by Dantzig and…
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems
Sina Dezfuli, Zachary Friggstad, Ian Post +1
We consider the rooted prize-collecting walks (PCW) problem, wherein we seek a collection of rooted walks having minimum prize-collecting cost, which is the (total cost of walk…
Automatic Embedding of Stories Into Collections of Independent Media
Dylan R. Ashley, Vincent Herrmann, Zachary Friggstad +2
We look at how machine learning techniques that derive properties of items in a collection of independent media can be used to automatically embed stories into such collections. To…
A Constant-Factor Approximation for Quasi-bipartite Directed Steiner Tree on Minor-Free Graphs
Zachary Friggstad, Ramin Mousavi
We give the first constant-factor approximation algorithm for quasi-bipartite instances of Directed Steiner Tree on graphs that exclude fixed minors. In particular, for -minor…