| Local Search Yields a PTAS for k-Means in Doubling Metrics Z Friggstad, M Rezapour, MR Salavatipour SIAM Journal On Computing -- FOCS-2016, 2016 | 127 | 2016 |
| Approximation schemes for clustering with outliers Z Friggstad, K Khodamoradi, M Rezapour, MR Salavatipour ACM Transactions on Algorithms -- SODA 2018, 398-414, 2018 | 42 | 2018 |
| Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding Z Friggstad, M Rezapour, MR Salavatipour SWAT 2016--LIPIcs-Leibniz International Proceedings in Informatics 53, 2016 | 12 | 2016 |
| An ACO algorithm to design UMTS access network using divided and conquer technique SM Hashemi, A Moradi, M Rezapour Engineering Applications of Artificial Intelligence 21 (6), 931-940, 2008 | 12 | 2008 |
| An effective hybrid PSO-based algorithm for planning UMTS terrestrial access networks SM Hashemi, M Rezapour, A Moradi Engineering Optimization 42 (3), 241-251, 2010 | 10 | 2010 |
| IP modeling of the survivable hop constrained connected facility location problem A Bley, SM Hashemi, M Rezapour Electronic Notes in Discrete Mathematics 41, 463-470, 2013 | 9 | 2013 |
| LP-based approximation algorithms for facility location in buy-at-bulk network design Z Friggstad, M Rezapour, MR Salavatipour, JA Soto Algorithmica -- WADS 2015, 373-385, 2015 | 6* | 2015 |
| Approximating connected facility location with buy-at-bulk edge costs via random sampling A Bley, M Rezapour Electronic Notes in Discrete Mathematics 44, 313-319, 2013 | 6 | 2013 |
| Approximation algorithms for a combined facility location buy-at-bulk network design problem A Bley, SM Hashemi, M Rezapour International Conference on Theory and Applications of Models of Computation …, 2013 | 5 | 2013 |
| Combinatorial approximation algorithms for buy-at-bulk connected facility location problems A Bley, M Rezapour Discrete Applied Mathematics 213, 34-46, 2016 | 4 | 2016 |
| Scheduling problems over a network of machines Z Friggstad, A Golestanian, K Khodamoradi, C Martin, M Rahgoshay, ... Journal of Scheduling 22 (2), 239-253, 2019 | 3 | 2019 |
| Network design with facility location: approximation and exact techniques M Rezapour TU Berlin, 2015 | 2 | 2015 |
| Exact Approaches for Designing Multifacility Buy-at-Bulk Networks A Arulselvan, M Rezapour, WA Welz INFORMS Journal on Computing 29 (4), 597-611, 2017 | 1 | 2017 |
| Monochromatic partitioning of colored points by lines H Jowhari, M Rezapour Information Processing Letters, 106402, 2023 | | 2023 |
| Algorithmic Approaches for Network Design with Facility Location: A Survey M Rezapour AUT Journal of Mathematics and Computing, 2022 | | 2022 |
| A Branch-Cut-And-Price Algorithm for a Combined Buy-at-Bulk Network Design Facility Location Problem A Arulselvan, M Rezapour, W Welz | | 2014 |
| Approximation algorithms for connected facility location with buy-at-bulk edge costs A Bley, M Hashemi, M Rezapour | | 2012 |
| Approximating Lower-and Upper-Bounded (Connected) Facility Location via LP Rounding Z Friggstad, M Rezapour, MR Salavatipour | | |
Mohammad SalavatipourProfessor of Computer Science, University of AlbertaVerified email at cs.ualberta.ca
