2 citations · 2 across the 3 of their papers we have counts for
5 papers
A Constant-Factor Approximation for Directed Latency
Jannis Blauth, Ramin Mousavi
In the Directed Latency problem, we are given an asymmetric metric space on a set of clients and a depot . We are looking for a path starting in t…
An -Approximation for Directed Steiner Tree in Planar Graphs
Zachary Friggstad, Ramin Mousavi
We present an -approximation for both the edge-weighted and node-weighted versions of \DST in planar graphs where is the number of terminals. We extend our approach…
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…
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…