Ramin Mousavi

activity

20212025

most citedParameterized Approximation Algorithms for

k

-Center Clustering and Variants

2 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing 2021 · cs.DSShow all

3 papers · 2 filters

cs.DS2021★ 2 cited

Parameterized Approximation Algorithms for $k$ -Center Clustering and Variants

Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi

$k$ -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…

cs.DS2021

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…

cs.DS2021

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 $K_{r}$ -minor…

Parameterized Approximation Algorithms for k-Center Clustering and Variants

Improved Approximations for CVRP with Unsplittable Demands

A Constant-Factor Approximation for Quasi-bipartite Directed Steiner Tree on Minor-Free Graphs

Parameterized Approximation Algorithms for $k$ -Center Clustering and Variants