Sledovať
Mohammad Salavatipour
Mohammad Salavatipour
Professor of Computer Science, University of Alberta
Overená e-mailová adresa na: cs.ualberta.ca - Domovská stránka
Názov
Citované v
Citované v
Rok
Packing steiner trees
K Jain, M Mahdian, MR Salavatipour
SODA 3, 266-274, 2003
2722003
A bound on the chromatic number of the square of a planar graph
M Molloy, MR Salavatipour
Journal of Combinatorial Theory, Series B 94 (2), 189-213, 2005
2712005
Planar graphs without cycles of length from 4 to 7 are 3-colorable
OV Borodin, AN Glebov, A Raspaud, MR Salavatipour
Journal of Combinatorial Theory, Series B 93 (2), 303-311, 2005
1862005
Combination can be hard: Approximability of the unique coverage problem
ED Demaine, U Feige, MT Hajiaghayi, MR Salavatipour
SIAM Journal on Computing 38 (4), 1464-1483, 2008
1782008
Survivable network design with degree or order constraints
LC Lau, J Naor, MR Salavatipour, M Singh
Proceedings of the thirty-ninth annual ACM symposium on theory of computing …, 2007
1622007
Local Search Yields a PTAS for -Means in Doubling Metrics
Z Friggstad, M Rezapour, MR Salavatipour
SIAM Journal on Computing 48 (2), 452-480, 2019
1582019
Approximation algorithms for nonuniform buy-at-bulk network design
C Chekuri, MT Hajiaghayi, G Kortsarz, MR Salavatipour
SIAM Journal on Computing 39 (5), 1772-1798, 2010
1072010
Approximation algorithms and hardness results for cycle packing problems
M Krivelevich, Z Nutov, MR Salavatipour, J Verstraete, R Yuster
ACM Transactions on Algorithms (TALG) 3 (4), 48-es, 2007
912007
Frequency channel assignment on planar networks
M Molloy, MR Salavatipour
Algorithms—ESA 2002: 10th Annual European Symposium Rome, Italy, September …, 2002
832002
Minimizing movement in mobile facility location problems
Z Friggstad, MR Salavatipour
ACM Transactions on Algorithms (TALG) 7 (3), 1-22, 2011
802011
A logarithmic approximation for unsplittable flow on line graphs
N Bansal, Z Friggstad, R Khandekar, MR Salavatipour
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
682009
Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
MR Khani, MR Salavatipour
Algorithmica 69 (2), 443-460, 2014
662014
Hardness and approximation results for packing Steiner trees
J Cheriyan, MR Salavatipour
Algorithmica 45, 21-43, 2006
642006
Approximation schemes for clustering with outliers
Z Friggstad, K Khodamoradi, M Rezapour, MR Salavatipour
ACM Transactions on Algorithms (TALG) 15 (2), 1-26, 2019
602019
On sum coloring of graphs
MR Salavatipour
Discrete Applied Mathematics 127 (3), 477-488, 2003
602003
Selecting dissimilar genes for multi-class classification, an application in cancer subtyping
Z Cai, R Goebel, MR Salavatipour, G Lin
BMC bioinformatics 8, 1-15, 2007
552007
The resolution complexity of random constraint satisfaction problems
M Molloy, MR Salavatipour
SIAM Journal on Computing 37 (3), 895-922, 2007
432007
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
MT Hajiaghayi, G Kortsarz, MR Salavatipour
Algorithmica 53, 89-103, 2009
422009
Approximation algorithms for node-weighted buy-at-bulk network design
C Chekuri, MT Hajiaghayi, G Kortsarz, MR Salavatipour
SODA 7, 1265-1274, 2007
402007
About computing science research methodology
JN Amaral, M Buro, R Elio, J Hoover, I Nikolaidis, M Salavatipour, ...
webdocs. cs. ualberta. ca/~ c603/readings/research-methods. pdf, 2011
382011
Systém momentálne nemôže vykonať operáciu. Skúste to neskôr.
Články 1–20