معرفی
Mohammad Salavatipour is a Professor in the Department of Computing Science at the University of Alberta and Associate Dean of Graduate Studies for the Faculty of Science. His research focuses on approximation algorithms and hardness results for NP-hard optimization problems.
Research areas include:
- Design and analysis of approximation algorithms
- Hardness of approximation proofs
- Algorithmic graph theory
- Probabilistic and randomized algorithms
- Combinatorial optimization
His recent publications develop approximation schemes for fundamental problems such as facility location, vehicle routing, and clustering in various metric spaces. Work includes quasi-polynomial time approximation schemes (QPTAS) and polynomial-time approximation schemes (PTAS) for geometrically constrained problems.
۰مقاله منتشرشده
