Mohammad R. Salavatipour

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 39

Top Topics

Algorithms And Data Structures

Approximation Algorithms

Facility Location

Top Venues

ACM Trans. Algorithms

Publications

Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour
Approximations for Throughput Maximization. Algorithmica 86 (5) (2024)
Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, Hao Sun
A QPTAS for Facility Location on Unit Disk graphs. CoRR (2024)
Mohammad R. Salavatipour, Lijiangnan Tian
Approximation Algorithms for the Airport and Railway Problem. SWAT (2024)
Kinter Ren, Mohammad R. Salavatipour
Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics. CoRR (2024)
Meng He, Anna Lubiw, Mohammad R. Salavatipour
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021). Algorithmica 85 (6) (2023)
Ismail Naderi, Mohsen Rezapour, Mohammad R. Salavatipour
Approximation Schemes for Min-Sum k-Clustering. ESA (2023)
Meng He, Anna Lubiw, Mohammad R. Salavatipour
Preface. Comput. Geom. 110 (2023)
Aditya Jayaprakash, Mohammad R. Salavatipour
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension. ACM Trans. Algorithms 19 (2) (2023)
Mirmahdi Rahgoshay, Mohammad R. Salavatipour
Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment. Algorithmica 84 (9) (2022)
Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour
Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands. IPCO (2022)
Aditya Jayaprakash, Mohammad R. Salavatipour
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension. SODA (2022)
Mirmahdi Rahgoshay, Mohammad R. Salavatipour
Hierarchical Clustering: New Bounds and Objective. CoRR (2021)
Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour
Special Issue on Algorithms and Data Structures (WADS 2019). Algorithmica 83 (3) (2021)
Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour
Improved Approximations for CVRP with Unsplittable Demands. CoRR (2021)
Aditya Jayaprakash, Mohammad R. Salavatipour
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension. CoRR (2021)
Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour
Approximations for Throughput Maximization. ISAAC (2020)
Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour
Approximations for Throughput Maximization. CoRR (2020)
Haozhou Pang, Mohammad R. Salavatipour
Approximation Algorithms for Generalized Path Scheduling. ISAAC (2020)
Mirmahdi Rahgoshay, Mohammad R. Salavatipour
Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment. STACS (2020)
Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour
Preface. Comput. Geom. 91 (2020)
Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour
Approximation Schemes for Clustering with Outliers. ACM Trans. Algorithms 15 (2) (2019)
Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS. SODA (2019)
Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour
Local Search Yields a PTAS for k-Means in Doubling Metrics. SIAM J. Comput. 48 (2) (2019)
Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar
Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median. Algorithmica 81 (3) (2019)
Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, Yifeng Zhang
Scheduling problems over a network of machines. J. Sched. 22 (2) (2019)
Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. Algorithmica 81 (3) (2019)
Christopher S. Martin, Mohammad R. Salavatipour
Minimizing Latency of Capacitated k-Tours. Algorithmica 80 (8) (2018)
Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour
Approximation Schemes for Clustering with Outliers. SODA (2018)
Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy
-Facility Location. ACM Trans. Algorithms 14 (2) (2018)
Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means. CoRR (2018)
Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour
Approximation Schemes for Clustering with Outliers. CoRR (2017)
Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, Yifeng Zhang
Scheduling Problems over Network of Machines. APPROX-RANDOM (2017)
Babak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem. Algorithmica 75 (1) (2016)
Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour
Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding. SWAT (2016)
Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos
How to Walk Your Dog in the Mountains with No Magic Leash. Discret. Comput. Geom. 55 (1) (2016)
M. Reza Khani, Mohammad R. Salavatipour
Improved approximations for buy-at-bulk and shallow-light k-Steiner trees and (k, 2)-subgraph. J. Comb. Optim. 31 (2) (2016)
Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour
Local Search Yields a PTAS for k-Means in Doubling Metrics. FOCS (2016)
Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour
Local Search Yields a PTAS for k-Means in Doubling Metrics. CoRR (2016)
Christopher S. Martin, Mohammad R. Salavatipour
Approximation Algorithms for Capacitated k-Travelling Repairmen Problems. ISAAC (2016)
Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. WADS (2015)
Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar
Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median. ICALP (1) (2015)
Babak Behsaz, Mohammad R. Salavatipour
On Minimum Sum of Radii and Diameters Clustering. Algorithmica 73 (1) (2015)
Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour
A logarithmic approximation for unsplittable flow on line graphs. ACM Trans. Algorithms 10 (1) (2014)
M. Reza Khani, Mohammad R. Salavatipour
Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems. Algorithmica 69 (2) (2014)
Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos
How to Walk Your Dog in the Mountains with No Magic Leash. CoRR (2014)
Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy
Approximation Algorithms for Minimum-Load k-Facility Location. APPROX-RANDOM (2014)
Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina
Asymmetric Traveling Salesman Path and Directed Latency Problems. SIAM J. Comput. 42 (4) (2013)
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour
Two-stage Robust Network Design with Exponential Scenarios. Algorithmica 65 (2) (2013)
Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos
How to walk your dog in the mountains with no magic leash. SCG (2012)
Babak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem. SWAT (2012)
Babak Behsaz, Mohammad R. Salavatipour
On Minimum Sum of Radii and Diameters Clustering. SWAT (2012)
Imran A. Pirwani, Mohammad R. Salavatipour
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs. Algorithmica 62 (3-4) (2012)
M. Reza Khani, Mohammad R. Salavatipour
Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems. APPROX-RANDOM (2011)
Zachary Friggstad, Mohammad R. Salavatipour
Minimizing movement in mobile facility location problems. ACM Trans. Algorithms 7 (3) (2011)
MohammadAli Safari, Mohammad R. Salavatipour
-Subgraph with Metric Costs. SIAM J. Discret. Math. 25 (3) (2011)
M. Reza Khani, Mohammad R. Salavatipour
Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph. ISAAC (2011)
Zachary Friggstad, Mohammad R. Salavatipour
Approximability of Packing Disjoint Cycles. Algorithmica 60 (2) (2011)
Imran A. Pirwani, Mohammad R. Salavatipour
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs. SWAT (2010)
Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina
Asymmetric Traveling Salesman Path and Directed Latency Problems. SODA (2010)
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design. SIAM J. Comput. 39 (5) (2010)
Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina
Asymmetric Traveling Salesman Path and Directed Latency Problems CoRR (2009)
Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh
Survivable Network Design with Degree or Order Constraints. SIAM J. Comput. 39 (3) (2009)
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
-Steiner Trees. Algorithmica 53 (1) (2009)
Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour
A logarithmic approximation for unsplittable flow on line graphs. SODA (2009)
Imran A. Pirwani, Mohammad R. Salavatipour
A PTAS for Minimum Clique Partition in Unit Disk Graphs CoRR (2009)
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour
Combination Can Be Hard: Approximability of the Unique Coverage Problem. SIAM J. Comput. 38 (4) (2008)
MohammadAli Safari, Mohammad R. Salavatipour
A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs. APPROX-RANDOM (2008)
Zachary Friggstad, Mohammad R. Salavatipour
Minimizing Movement in Mobile Facility Location Problems. FOCS (2008)
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour
Two-Stage Robust Network Design with Exponential Scenarios. ESA (2008)
Zhipeng Cai, Randy Goebel, Mohammad R. Salavatipour, Yi Shi, Lizhe Xu, Guohui Lin
Selecting Genes with Dissimilar Discrimination Strength for Sample Class Prediction. APBC (2007)
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
Approximation algorithms for node-weighted buy-at-bulk network design. SODA (2007)
Zhipeng Cai, Randy Goebel, Mohammad R. Salavatipour, Guohui Lin
Selecting dissimilar genes for multi-class classification, an application in cancer subtyping. BMC Bioinform. 8 (2007)
Omid Madani, Wiley Greiner, David Kempe, Mohammad R. Salavatipour
Recall Systems: Effcient Learning and Use of Category Indices. AISTATS (2007)
Zachary Friggstad, Mohammad R. Salavatipour
Approximability of Packing Disjoint Cycles. ISAAC (2007)
Joseph Cheriyan, Mohammad R. Salavatipour
Packing element-disjoint steiner trees. ACM Trans. Algorithms 3 (4) (2007)
Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraëte, Raphael Yuster
Approximation algorithms and hardness results for cycle packing problems. ACM Trans. Algorithms 3 (4) (2007)
Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh
Survivable network design with degree or order constraints. STOC (2007)
Michael Molloy, Mohammad R. Salavatipour
The Resolution Complexity of Random Constraint Satisfaction Problems. SIAM J. Comput. 37 (3) (2007)
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
Approximating Buy-at-Bulk k-Steiner trees Electron. Colloquium Comput. Complex. (007) (2006)
Zhipeng Cai, Lizhe Xu, Yi Shi, Mohammad R. Salavatipour, Randy Goebel, Guohui Lin
Using Gene Clustering to Identify Discriminatory Genes with Higher Classification Accuracy. BIBE (2006)
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. FOCS (2006)
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour
Combination can be hard: approximability of the unique coverage problem. SODA (2006)
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk Electron. Colloquium Comput. Complex. (008) (2006)
Joseph Cheriyan, Mohammad R. Salavatipour
Hardness and Approximation Results for Packing Steiner Trees. Algorithmica 45 (1) (2006)
Mohammad R. Salavatipour
Large Induced Forests in Triangle-Free Planar Graphs. Graphs Comb. 22 (1) (2006)
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
-Steiner Trees. APPROX-RANDOM (2006)
Michael Molloy, Mohammad R. Salavatipour
A bound on the chromatic number of the square of a planar graph. J. Comb. Theory, Ser. B 94 (2) (2005)
Oleg V. Borodin, Alexei N. Glebov, André Raspaud, Mohammad R. Salavatipour
Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. Comb. Theory, Ser. B 93 (2) (2005)
Joseph Cheriyan, Mohammad R. Salavatipour
Packing Element-Disjoint Steiner Trees. APPROX-RANDOM (2005)
Mohammad R. Salavatipour, Jacques Verstraëte
Disjoint Cycles: Integrality Gap, Hardness, and Approximation. IPCO (2005)
Mohammad R. Salavatipour
-trees. Discret. Appl. Math. 143 (1-3) (2004)
Mohammad R. Salavatipour
A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma. Random Struct. Algorithms 25 (1) (2004)
Joseph Cheriyan, Mohammad R. Salavatipour
Hardness and Approximation Results for Packing Steiner Trees. ESA (2004)
Michael Molloy, Mohammad R. Salavatipour
The Resolution Complexity of Random Constraint Satisfaction Problems. FOCS (2003)
Mohammad R. Salavatipour
On Sum Coloring of Graphs. Discret. Appl. Math. 127 (3) (2003)
Kamal Jain, Mohammad Mahdian, Mohammad R. Salavatipour
Packing Steiner trees. SODA (2003)
Mohammad R. Salavatipour
A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma. SODA (2003)
Michael Molloy, Mohammad R. Salavatipour
Frequency Channel Assignment on Planar Networks. ESA (2002)
Mohammad Mahdian, Ebadollah S. Mahmoodian, Amin Saberi, Mohammad R. Salavatipour, Ruzbeh Tusserkani
On a conjecture of Keedwell and the cycle double cover conjecture. Discret. Math. 216 (1-3) (2000)