Mohammadhossein Bateni

MohammadHossein Bateni is a senior research scientist at Google, where he is a member of the NYC Algorithms and Optimization Team. He obtained his Ph.D. and M.A. in Computer Science from Princeton University in 2011 and 2008, respectively, after finishing his undergraduate studies with a B.Sc. in Computer Engineering at Sharif University of Technology in 2006. Hossein is broadly interested in combinatorics and combinatorial optimization. His research focuses on approximation algorithms for network design problems and analyzing game-theoretic models.

Google Publications

Previous Publications


    Euclidean Prize-Collecting Steiner Forest

    Mohammadhossein Bateni, MohammadTaghi Hajiaghayi

    Algorithmica, vol. 62 (2012), pp. 906-929


    Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

    Mohammadhossein Bateni, MohammadTaghi Hajiaghayi, Daniel Marx

    Journal of the ACM, vol. 58(5) (2011), pp. 21


    Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP

    Aaron Archer, Mohammadhossein Bateni, MohammadTaghi Hajiaghayi, Howard Karloff

    SIAM Journal on Computing, vol. 40(2) (2011), pp. 309-332


    Prize-collecting Steiner Problems on Planar Graphs

    Mohammadhossein Bateni, Chandra Chekuri, Alina Ene, MohammadTaghi Hajiaghayi, Nitish Korula, Daniel Marx

    Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia, PA (2011), pp. 1028-1049


    Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses

    Mohammadhossein Bateni, Lukasz Golab, MohammadTaghi Hajiaghayi, Howard Karloff

    Theory of Computing Systems, vol. 49(4) (2011), pp. 757-780


    Towards an efficient algorithmic framework for pricing cellular data service

    Mohammadhossein Bateni, MohammadTaghi Hajiaghayi, Sina Jafarpour, Dan Pei

    Proceedings of the 30th Annual Conference of the IEEE Communications Society (INFOCOM), IEEE Computer Society, Los Alamitos, CA (2011), pp. 581-585