Ramin Mousavi

According to our database, Ramin Mousavi authored at least 9 papers between 2019 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

A Parameterized Approximation Scheme for Generalized Partial Vertex Cover.

Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs.

Zachary Friggstad, Ramin Mousavi

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

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

Zachary Friggstad, Ramin Mousavi

Proceedings of the Approximation, 2023

2022

Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP.

Zachary Friggstad, Ramin Mousavi

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands.

Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Parameterized Approximation Algorithms for K-center Clustering and Variants.

Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Improved Approximations for CVRP with Unsplittable Demands.

Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour

CoRR, 2021

Fair Correlation Clustering with Global and Local Guarantees.

Zachary Friggstad, Ramin Mousavi

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

2019

Thin trees in 8-edge-connected planar graphs.

Ramin Mousavi

Inf. Process. Lett., 2019