Folgen
Ramin Mousavi
Ramin Mousavi
Bestätigte E-Mail-Adresse bei ualberta.ca
Titel
Zitiert von
Zitiert von
Jahr
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
112022
Fair correlation clustering with global and local guarantees
Z Friggstad, R Mousavi
Algorithms and Data Structures: 17th International Symposium, WADS 2021 …, 2021
102021
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
62022
Improved approximations for CVRP with unsplittable demands
Z Friggstad, R Mousavi, M Rahgoshay, MR Salavatipour
arXiv preprint arXiv:2111.08138, 2021
62021
A Constant-Factor Approximation for Quasi-bipartite Directed Steiner Tree on Minor-Free Graphs
Z Friggstad, R Mousavi
arXiv preprint arXiv:2111.02572, 2021
32021
An -Approximation for Directed Steiner Tree in Planar Graphs
Z Friggstad, R Mousavi
arXiv preprint arXiv:2302.04747, 2023
12023
Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP
Z Friggstad, R Mousavi
33rd International Symposium on Algorithms and Computation (ISAAC 2022), 2022
12022
Thin trees in some families of distance-regular graphs
R Mousavi
Linear and Multilinear Algebra 68 (7), 1374-1383, 2020
12020
A Parameterized Approximation Scheme for Generalized Partial Vertex Cover
S Bandyapadhyay, Z Friggstad, R Mousavi
Algorithms and Data Structures Symposium, 93-105, 2023
2023
Thin trees in 8-edge-connected planar graphs
R Mousavi
Information Processing Letters 143, 51-55, 2019
2019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–10