☰

Mohammad R. Salavatipour - Publications

Affiliations: 
Computing Science University of Alberta, Edmonton, Alberta, Canada 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

44 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Friggstad Z, Khodamoradi K, Rezapour M, Salavatipour MR. Approximation Schemes for Clustering with Outliers Acm Transactions On Algorithms. 15: 1-26. DOI: 10.1145/3301446  0.43
2019 Friggstad Z, Rezapour M, Salavatipour MR. Local Search Yields a PTAS for $k$-Means in Doubling Metrics Siam Journal On Computing. 48: 452-480. DOI: 10.1137/17M1127181  0.76
2019 Friggstad Z, Golestanian A, Khodamoradi K, Martin CS, Rahgoshay M, Rezapour M, Salavatipour MR, Zhang Y. Scheduling problems over a network of machines Journal of Scheduling. 22: 239-253. DOI: 10.1007/S10951-018-0591-Z  0.748
2018 Ahmadian S, Behsaz B, Friggstad Z, Jorati A, Salavatipour MR, Swamy C. Approximation Algorithms for Minimum-Load k -Facility Location Acm Transactions On Algorithms. 14: 16. DOI: 10.1145/3173047  0.739
2018 Martin CS, Salavatipour MR. Minimizing Latency of Capacitated k -Tours Algorithmica. 80: 2492-2511. DOI: 10.1007/S00453-017-0337-X  0.577
2016 Khani MR, Salavatipour MR. Improved approximations for buy-at-bulk and shallow-light k-Steiner trees and (k, 2)-subgraph Journal of Combinatorial Optimization. 31: 669-685. DOI: 10.1007/S10878-014-9774-5  0.554
2016 Behsaz B, Salavatipour MR, Svitkina Z. New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem Algorithmica. 75: 53-83. DOI: 10.1007/S00453-015-0012-Z  0.795
2015 Friggstad Z, Rezapour M, Salavatipour MR, Soto JA. LP-based approximation algorithms for facility location in buy-at-bulk network design Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9214: 373-385. DOI: 10.1007/S00453-018-0458-X  0.797
2015 Behsaz B, Friggstad Z, Salavatipour MR, Sivakumar R. Approximation algorithms for min-sum k-clustering and balanced k-median Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9134: 116-128. DOI: 10.1007/S00453-018-0454-1  0.745
2014 Ahmadian S, Behsaz B, Friggstad Z, Jorati A, Salavatipour MR, Swamy C. Approximation algorithms for minimum-load κ-facility location Leibniz International Proceedings in Informatics, Lipics. 28: 17-33. DOI: 10.4230/LIPIcs.APPROX-RANDOM.2014.17  0.715
2014 Bansal N, Friggstad Z, Khandekar R, Salavatipour MR. A logarithmic approximation for unsplittable flow on line graphs Acm Transactions On Algorithms. 10. DOI: 10.1145/2532645  0.791
2014 Behsaz B, Salavatipour MR. On Minimum Sum of Radii and Diameters Clustering Algorithmica. 73: 143-165. DOI: 10.1007/S00453-014-9907-3  0.802
2014 Khani MR, Salavatipour MR. Improved approximation algorithms for the min-max tree cover and bounded tree cover problems Algorithmica. 69: 443-460. DOI: 10.1007/S00453-012-9740-5  0.535
2013 Khandekar R, Kortsarz G, Mirrokni V, Salavatipour MR. Two-stage robust network design with exponential scenarios Algorithmica. 65: 391-408. DOI: 10.1007/S00453-011-9596-0  0.529
2012 Har-Peled S, Nayyeri A, Sidiropoulos A, Salavatipour M. How to walk your dog in the mountains with no magic leash Proceedings of the Annual Symposium On Computational Geometry. 121-130. DOI: 10.1007/S00454-015-9737-3  0.441
2012 Pirwani IA, Salavatipour MR. A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs Algorithmica. 62: 1050-1072. DOI: 10.1007/S00453-011-9503-8  0.526
2011 Friggstad Z, Salavatipour MR. Minimizing movement in mobile facility location problems Acm Transactions On Algorithms. 7. DOI: 10.1145/1978782.1978783  0.787
2011 Safari M, Salavatipour MR. A constant factor approximation for minimum λ-edge-connected k-subgraph with metric costs Siam Journal On Discrete Mathematics. 25: 1089-1102. DOI: 10.1137/080729918  0.554
2011 Khani MR, Salavatipour MR. Improved approximations for buy-at-bulk and shallow-light k-Steiner trees and (k,2)-subgraph Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7074: 20-29. DOI: 10.1007/978-3-642-25591-5_4  0.457
2010 Friggstad Z, Salavatipour MR, Svitkina Z. Asymmetric traveling salesman path and directed latency problems Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 419-428. DOI: 10.1137/100797357  0.8
2010 Chekuri C, Hajiaghayi MT, Kortsarz G, Salavatipour MR. Approximation algorithms for nonuniform buy-at-bulk network design Siam Journal On Computing. 39: 1772-1798. DOI: 10.1137/090750317  0.442
2010 Pirwani IA, Salavatipour MR. A weakly robust PTAS for minimum clique partition in unit disk graphs (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6139: 188-199. DOI: 10.1007/978-3-642-13731-0_19  0.483
2010 Friggstad Z, Salavatipour MR, Svitkina Z. Asymmetric traveling salesman path and directed latency problems Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 419-428.  0.498
2009 Hajiaghayi MT, Kortsarz G, Salavatipour MR. Approximating buy-at-bulk and shallow-light k-steiner trees Algorithmica (New York). 53: 89-103. DOI: 10.1007/S00453-007-9013-X  0.531
2008 Demaine ED, Feige U, Hajiaghayi M, Salavatipour MR. Combination Can Be Hard: Approximability of the Unique Coverage Problem Siam Journal On Computing. 38: 1464-1483. DOI: 10.1137/060656048  0.572
2007 Krivelevich M, Nutov Z, Salavatipour MR, Yuster JV, Yuster R. Approximation algorithms and hardness results for cycle packing problems Acm Transactions On Algorithms. 3. DOI: 10.1145/1290672.1290685  0.536
2007 Molloy M, Salavatipour MR. The resolution complexity of random constraint satisfaction problems Siam Journal On Computing. 37: 895-922. DOI: 10.1137/S0097539703436485  0.393
2007 Lau LC, Naor J, Salavatipour MR, Singh M. Survivable network design with degree or order constraints Proceedings of the Annual Acm Symposium On Theory of Computing. 651-660. DOI: 10.1137/070700620  0.586
2007 Friggstad Z, Salavatipour MR. Approximability of packing disjoint cycles Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4835: 304-315. DOI: 10.1007/S00453-009-9349-5  0.8
2007 Chekuri C, Hajiaghayi MT, Kortsarz G, Salavatipour MR. Approximation algorithms for node-weighted buy-at-bulk network design Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 7: 1265-1274.  0.318
2006 Demaine ED, Feige U, Hajiaghayi MT, Salavatipour MR. Combination can be hard: Approximability of the unique coverage problem Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 162-171. DOI: 10.1145/1109557.1109577  0.503
2006 Chekuri C, Hajiaghayi MT, Kortsarz G, Salavatipour MR. Approximation algorithms for non-uniform buy-at-bulk network design Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 677-686. DOI: 10.1137/090750317  0.465
2006 Salavatipour MR. Large induced forests in triangle-free planar graphs Graphs and Combinatorics. 22: 113-126. DOI: 10.1007/S00373-006-0642-7  0.345
2005 Cheriyan J, Salavatipour MR. Packing element-disjoint Steiner trees Lecture Notes in Computer Science. 3624: 52-61. DOI: 10.1145/1290672.1290684  0.544
2005 Molloy M, Salavatipour MR. A bound on the chromatic number of the square of a planar graph Journal of Combinatorial Theory. Series B. 94: 189-213. DOI: 10.1016/J.Jctb.2004.12.005  0.362
2005 Borodin OV, Glebov AN, Raspaud A, Salavatipour MR. Planar graphs without cycles of length from 4 to 7 are 3-colorable Journal of Combinatorial Theory. Series B. 93: 303-311. DOI: 10.1016/J.Jctb.2004.11.001  0.341
2005 Salavatipour MR, Verstraete J. Disjoint cycles: Integrality gap, hardness, and approximation Lecture Notes in Computer Science. 3509: 51-65.  0.478
2004 Salavatipour MR. A polynomial time algorithm for strong edge coloring of partial k -trees Discrete Applied Mathematics. 143: 285-291. DOI: 10.1016/J.Dam.2004.03.001  0.482
2004 Cheriyan J, Salavatipour MR. Hardness and approximation results for packing steiner trees Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3221: 180-191. DOI: 10.1007/S00453-005-1188-4  0.483
2004 Salavatipour MR. A (1 + ε)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma Random Structures and Algorithms. 25: 68-90. DOI: 10.1002/Rsa.20016  0.437
2003 Salavatipour MR. On sum coloring of graphs Discrete Applied Mathematics. 127: 477-488. DOI: 10.1016/S0166-218X(02)00249-4  0.471
2003 Salavatipour MR. A (1+ε)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 347-356.  0.335
2003 Jain K, Mahdian M, Salavatipour MR. Packing Steiner trees Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 266-274.  0.489
2000 Mahdian M, Mahmoodian ES, Saberi A, Salavatipour MR, Tusserkani R. On a conjecture of Keedwell and the cycle double cover conjecture Discrete Mathematics. 216: 287-292. DOI: 10.1016/S0012-365X(99)00356-8  0.36
Show low-probability matches.