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

A Study of Compact Reserve Pricing Languages

MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni, Saeed Seddighin

AAAI 2017 (2017), pp. 363-368
A study of compact reserve pricing languages

MohammadHossein Bateni, Hossein Esfandiari, Vahab Mirrokni, Saeed Seddighin

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (2017), pp. 363-368
Affinity Clustering: Hierarchical Clustering at Scale

MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, Vahab Mirrokni

NIPS 2017, pp. 6867-6877
Almost Optimal Streaming Algorithms for Coverage Problems

Mohammadhossein Bateni, Hossein Esfandiari, Vahab Mirrokni

29th ACM Symposium on Parallelism in Algorithms and Architectures (2017)
A PTAS for Planar Group Steiner Tree via Bootstrapping Approximation

Daniel Marx, Erik Demaine, MohammadHossein Bateni, MohammadTaghi Hajiaghayi

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, ACM, pp. 570-583
Distributed Balanced Partitioning via Linear Embedding

Kevin Aydin, Mohammadhossein Bateni, Vahab Mirrokni

WSDM 2016: Ninth ACM International Conference on Web Search and Data Mining, ACM (to appear)
Distributed Coverage Maximization via Sketching

MohammadHossein Bateni, Hossein Esfandiari, Vahab Mirrokni

arXiv (2016) (to appear)
Fair Resource Allocation in A Volatile Marketplace

MohammadHossein Bateni, Yiwei Chen, Dragos Florin Ciocan, Vahab S. Mirrokni

EC (2016), pp. 819
Revenue Maximization for Selling Multiple Correlated Items

Mohammadhossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, Saeed Seddighin

23rd Annual European Symposium on Algorithms (ESA), Springer-Verlag (2015)
Revenue Maximization with Nonexcludable Goods

Mohammadhossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam

Transactions on Economics and Computation (2015)
Concise Bid Optimization Strategies with Multiple Budget Constraints

Arash Asadpour, Mohammadhossein Bateni, Kshipra Bhawalkar, Vahab Mirrokni

WINE, The 10th Conference on Web and Internet Economics (2014)
Distributed Balanced Clustering via Mapping Coresets

Mohammadhossein Bateni, Aditya Bhaskara, Silvio Lattanzi, Vahab Mirrokni

NIPS, Neural Information Processing Systems Foundation (2014)
Multiplicative Bidding in Online Advertising

Mohammadhossein Bateni, Jon Feldman, Vahab Mirrokni, Sam Chiu-wai Wong

ACM Conference on Economics and Computation (EC) (2014)
Network Cournot Competition

Melika Abolhasani, Mohammadhossein Bateni, MohammadTaghi Hajiaghayi, Hamid Mahini, Anshul Sawant

WINE, The 10th Conference on Web and Internet Economics (2014)
Secretary Problems and Online Auctions

Mohammadhossein Bateni

Encyclopedia of Algorithms, Springer (2014), pp. 1-4
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems

Mohammadhossein Bateni, Julia Chuzhoy

Algorithmica, vol. 65 (2013), pp. 545-561
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems

Mohammadhossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat

ICALP, Springer (2013)
Revenue Maximization with Nonexcludable Goods

Mohammadhossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam

Internet and Network Economics - 9th International Workshop, WINE 2013, Springer
Submodular secretary problems with extensions

Mohammadhossein Bateni, MohammadTaghi Hajiaghayi, Morteza Zadimoghaddam

ACM Transactions on Algorithms, vol. 9 (4) (2013)
Submodular secretary problems with extensions

Mohammadhossein Bateni, MohammadTaghi Hajiaghayi, Morteza Zadimoghaddam

ACM Transactions on Algorithms, vol. 9 (4) (2013)
A polynomial-time approximation scheme for planar multiway cut

Mohammadhossein Bateni, MohammadTaghi Hajiaghayi, Philip Klein, Claire Mathieu

Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2012)

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

Mohammadhossein Bateni

Co-Authors

Google Publications

Previous Publications