Improved approximations for capacitated vehicle routing with unsplittable client demands Z Friggstad, R Mousavi, M Rahgoshay, MR Salavatipour
International Conference on Integer Programming and Combinatorial …, 2022
17 2022 Fair correlation clustering with global and local guarantees Z Friggstad, R Mousavi
Algorithms and Data Structures: 17th International Symposium, WADS 2021 …, 2021
15 2021 Parameterized approximation algorithms for k-center clustering and variants S Bandyapadhyay, Z Friggstad, R Mousavi
Proceedings of the AAAI Conference on Artificial Intelligence 36 (4), 3895-3903, 2022
9 2022 Improved approximations for CVRP with unsplittable demands Z Friggstad, R Mousavi, M Rahgoshay, MR Salavatipour
arXiv preprint arXiv:2111.08138, 2021
7 2021 A constant-factor approximation for quasi-bipartite directed steiner tree on minor-free graphs Z Friggstad, R Mousavi
arXiv preprint arXiv:2111.02572, 2021
6 2021 An -Approximation for Directed Steiner Tree in Planar Graphs Z Friggstad, R Mousavi
arXiv preprint arXiv:2302.04747, 2023
5 2023 Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP Z Friggstad, R Mousavi
33rd International Symposium on Algorithms and Computation (ISAAC 2022), 8 …, 2022
2 2022 A parameterized approximation scheme for generalized partial vertex cover S Bandyapadhyay, Z Friggstad, R Mousavi
Algorithms and Data Structures Symposium, 93-105, 2023
1 2023 Thin trees in some families of distance-regular graphs R Mousavi
Linear and Multilinear Algebra 68 (7), 1374-1383, 2020
1 2020 Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants S Bandyapadhyay, Z Friggstad, R Mousavi
Algorithmica 86 (8), 2557-2574, 2024
2024 LIPIcs, Volume 248, ISAAC 2022, Complete Volume}} SW Bae, H Park, K Sadakane, J Erickson, L Hellerstein, T Lidbetter, ...
33rd International Symposium on Algorithms and Computation (ISAAC 2022) 248, 0, 2022
2022 Fair Correlation Clustering with Global Z Friggstad, R Mousavi
Algorithms and Data Structures: 17th International Symposium, WADS 2021 …, 2021
2021 Thin trees in 8-edge-connected planar graphs R Mousavi
Information Processing Letters 143, 51-55, 2019
2019