Morteza Zadimoghaddam

Sharif University of Technology, Vassar College

Papers

Total Citations

H-Index

About

Morteza Zadimoghaddam is a computer scientist whose research centers on approximation algorithms, combinatorial optimization, and the algorithmic foundations of large-scale movement and coordination problems. His most influential work, the 2009 paper "Minimizing Movement" (75 citations), introduces novel approximation algorithms and inapproximability results for a broad class of movement problems—ranging from coordinating robot swarms and firefighter teams to optimizing map labels and network message routing. This foundational contribution established new theoretical frameworks for minimizing total displacement while achieving global objectives. Building on this, his 2011 paper "O(1)-Approximations for Maximum Movement Problems" (12 citations) extends the theory by providing constant-factor approximation guarantees for maximizing movement efficiency under constraints. Zadimoghaddam’s work is notable for bridging abstract algorithmic theory with practical applications in robotics, logistics, and distributed systems. His contributions have helped shape the modern understanding of coordinated motion planning, offering both provable performance bounds and insights into the inherent difficulty of these problems. For students and researchers, his papers serve as essential reading in the intersection of approximation algorithms and real-world coordination challenges.