Mohammad Salavatipour, PhD
Contact
Chair, Faculty of Science - Computing Science
- mrs@ualberta.ca
Overview
About
Education
- B.Sc., Computer Engineering, Sharif University of Technology, 1998
- M.Sc., Computer Science, University of Toronto, 2000
- Ph.D., Computer Science, University of Toronto, 2003
Research
Area
Algorithmics
Interests
Approximation Algorithms, Hardness of Approximation, Algorithmic Graph Theory, Probabilistic and Randomized Algorithms.
Summary
I am interested in design and analysis of algorithms; in particular approximation algorithms and hardness of approximation. Most of these problems are optimization problems that are known to be hard. Our goal is to design efficient algorithms with provable guarantee on the quality of the solution with respect to the optimum one. These problems arise in various applications such as clustering problems, vehicle routing, scheduling, and network design.
Courses
CMPUT 304 - Algorithms II
The second course of a two-course sequence on algorithm design. Emphasis on principles of algorithm design. Categories of algorithms such as divide-and-conquer, greedy algorithms, dynamic programming; analysis of algorithms; limits of algorithm design; NP-completeness; heuristic algorithms. Prerequisites: CMPUT 204; one of STAT 151, 161, 181, 235, 265, SCI 151, or MATH 181; and one of MATH 102, 125, 126, or 127.