Mohammad Hossein
Bateni
Senior Research Scientist
Google, New York
Mohammad Hossein
Bateni
Senior Research Scientist
Google, New York

All publications

On Distributed Hierarchical Clustering
Large-scale
  • NIPS 2017, 30th Annual Conference on Advances in Neural Information Processing Systems
Almost optimal streaming algorithms for coverage problems
Large-scale
  • SPAA 2017, 29th ACM Symposium on Parallelism in Algorithms and Architectures
A study of compact reserve pricing languages
Algorithmic game theory
  • AAAI 2017, 31st AAAI Conference on Artificial Intelligence
Fair Resource Allocation in A Volatile Marketplace
Algorithmic game theory
  • EC 2016, 17th ACM Conference on Economics and Computation
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting
PTAS Planar Network design Price-collecting clustering
  • STOC 2016, 48th Annual ACM SIGACT Symposium on Theory of Computing
Distributed Balanced Partitioning via Linear Embedding
Large-scale
  • WSDM 2016, Ninth ACM International Conference on Web Search and Data Mining
Secretary Problems and Online Auctions
Algorithmic game theory
  • Encyclopedia of Algorithms 2016
Revenue Maximization for Selling Multiple Correlated Items
Algorithmic game theory
  • ESA 2015, 23rd Annual European Symposium of Algorithms
Distributed Balanced Clustering via Mapping Coresets
Large-scale
  • NIPS 2014, 27th Annual Conference on Advances in Neural Information Processing Systems
Multiplicative Bidding in Online Advertising
Algorithmic game theory Approximation algorithms
  • EC 2014, 15th ACM Conference on Economics and Computation
Concise Bid Optimization Strategies with Multiple Budget Constraints
Algorithmic game theory Approximation algorithms PTAS
  • WINE 2014, 10th International Conference on Web and Internet Economics
Network Cournot Competition
Algorithmic game theory
  • WINE 2014, 10th International Conference on Web and Internet Economics
Revenue Maximization with Nonexcludable Goods
Algorithmic game theory
  • WINE 2013, Ninth International Conference of Web and Internet Economics
  • ACM Transactions of Economics and Computing 3(4): 18 (2015)
Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems
Approximation algorithms Network design
  • ICALP 2013, 40th International Colloquium on Automata, Languages, and Programming
A polynomial-time approximation scheme for planar multiway cut
PTAS Planar Network design Price-collecting clustering
  • SODA 2012, 23rd Annual ACM-SIAM Symposium on Discrete Algorithms
Towards an efficient algorithmic framework for pricing cellular data service
Algorithmic game theory
  • INFOCOM 2011, 30th Annual Conference of the IEEE Communications Society
Prize-collecting network design on planar graphs
PTAS Approximation algorithms Planar Network design Price-collecting clustering
  • SODA 2011, 22nd Annual ACM-SIAM Symposium on Discrete Algorithms
The submodular secretary problem and its extensions
Approximation algorithms
  • APPROX 2010, 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
  • ACM Trans. Algorithms 9(4): 32 (2013)
Approximation Algorithms for the Directed k-Stroll and k-Tour Problems
Approximation algorithms Network design
  • APPROX 2010, 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
  • Algorithmica 65(3): 545-561 (2013)
Cooperative game theory foundations of network bargaining games
Algorithmic game theory
  • ICALP 2010, 37th International Colloquium on Automata, Languages and Programming
PTASes for Steiner forest on planar graphs and graphs of bounded treewidth
PTAS Planar Network design Price-collecting clustering
  • STOC 2010, 42nd ACM Symposium on Theory of Computing
  • Journal of the ACM 58(5): 21 (2011)
Euclidean Prize-collecting Steiner Forest
PTAS Geometric Network design
  • LATIN 2010, 9th Latin American Theoretical Informatics Symposium
  • Algorithmica 62(3-4): 906-929 (2012)
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
Approximation algorithms Network design Price-collecting clustering
  • FOCS 2009, 50th Annual IEEE Symposium on Foundations of Computer Science
  • SIAM Journal on Computing, Volume 40, Issue 2, pp. 309-332
A note on the subadditive network design problem
Approximation algorithms Network design
  • Operations Research Letters, Volume 37, Issue 5, Sept. 2009, pp. 339-344
New Approximation Algorithms for Degree Lower-bounded Arborescences and Max-Min Allocation
Approximation algorithms Fair allocation
  • Technical Report TR-848-09, March 2009, Department of Computer Science, Princeton University
Minimizing Staleness and Stretch in Real-Time Data Ware-houses
Scheduling
  • SPAA 2009, 21st ACM Symposium on Parallelism in Algorithms and Architectures
  • Theory of Computing Systems [Special Issue on SPAA 2009], Volume 49, Number 4, pp. 757-780 (2011)
MaxMin allocation via degree lower-bounded arborescences
Approximation algorithms Fair allocation
  • STOC 2009, 41st ACM Symposium on Theory of Computing
Multi-VPN Optimization for Scalable Routing via Relaying
Network design
  • INFOCOM 2009, 28th Annual Conference of the IEEE Communications Society
  • IEEE/ACM Transactions on Networking, Volume 18, Number 5, pp. 1544-1556
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
PTAS Network design
  • SODA 2009, 20th Annual ACM-SIAM Symposium on Discrete Algorithms
  • ACM Transactions of Algorithms 8(3): 20 (2012)
Plane Embedding of Planar Graph Metrics
Planar Geometric
  • SoCG 2006, 22nd Annual ACM Symposium on Computational Geometry
  • Journal of Discrete and Computational Geometry, Volume 38, Number 3, pp. 615-637