Mohammadhossein Bateni
Google Publications
-
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)
-
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
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







