Mohammad R. Salavatipour

110 papers A* 15A 7B 13C 1Journal 60Unranked 13

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