Mohammad Hossein BATENI

Since Fall 2006, I have been a graduate student at Computer Science Department of Princeton University. My advisor is Professor Moses Charikar. I received my B.Sc. from the Department of Computer Engineering of Sharif University of Technology, Tehran, Iran.
Contact information: 35 Olden Street Computer Science Department Princeton University Princeton, NJ 08540
E-mail:
Here, you can find my resume. My personal homepage is available here.

Research Interests

• Algorithms, (Combinatorial) Optimization
• Approximation Algorithms and Hardness of Approximation
• Network Design, Mobile Computing, Network Management
• Fair Allocation, Algorithmic Game Theory
• Graph Theory, Combinatorics
• Parallel and Distributed Computing, Job Scheduling
• Computational Geometry

Research Papers

Towards an efficient algorithmic framework for pricing cellula data service
with MohammadTaghi Hajiaghayi, Sina Jafarpour and Dan Pei
submitted.

Polynomial-time approximation scheme for planar multiway cut
with MohammadTaghi Hajiaghayi, Philip N. Klein and Claire Mathieu
submitted.

Prize-collecting network design on planar graphs
with MohammadTaghi Hajiaghayi and Dániel Marx
submitted.

The submodular secretary problem and its extensions
with MohammadTaghi Hajiaghayi and Morteza Zadimoghaddam
—To appear in APPROX 2010, 13^th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Approximation Algorithms for the Directed k-Stroll and k-Tour Problems
with Julia Chuzhoy
—To appear in APPROX 2010, 13^th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Cooperative game theory foundations of network bargaining games
with MohammadTaghi Hajiaghayi, Nicole Immorlica and Hamid Mahini
—To appear in ICALP 2010, 37^th International Colloquium on Automata, Languages and Programming

PTASs for Steiner forest on planar graphs and graphs of bounded treewidth
with MohammadTaghi Hajiaghayi and Dániel Marx
—STOC 2010, 42^nd ACM Symposium on Theory of Computing

Euclidean Prize-collecting Steiner Forest
with MohammadTaghi Hajiaghayi
—LATIN 2010, 9^th Latin American Theoretical Informatics Symposium

Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
with Aaron Archer, MohammadTaghi Hajiaghayi and Howard Karloff
—FOCS 2009, 50^th Annual IEEE Symposium on Foundations of Computer Science
—To appear in SIAM Journal on Computing.

A note on the subadditive network design problem
with MohammadTaghi Hajiaghayi
—Operations Research Letters, Volume 37, Issue 5, Sept. 2009, pp. 339-344

New Approximation Algorithms for Degree Lower-bounded Arborescences and Max-Min Allocation
with Moses Charikar and Venkatesan Guruswami
Technical Report TR-848-09, March 2009, Department of Computer Science, Princeton University
to be submitted.

Minimizing Staleness and Stretch in Real-Time Data Ware-houses
with Lukasz Golab, MohammadTaghi Hajiaghayi and Howard Karloff
—SPAA 2009, 21^st ACM Symposium on Parallelism in Algorithms and Architectures
—Invited to the Theory of Computing Systems Special Issue on SPAA 2009.

MaxMin allocation via degree lower-bounded arborescences
with Moses Charikar and Venkatesan Guruswami
—STOC 2009, 41^st ACM Symposium on Theory of Computing

Multi-VPN Optimization for Scalable Routing via Relaying
with Alexandre Gerber, MohammadTaghi Hajiaghayi and Subhabrata Sen
—INFOCOM 2009, 28^th Annual Conference of the IEEE Communications Society
—To appear in IEEE/ACM Transactions on Networking

Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
with MohammadTaghi Hajiaghayi
—SODA 2009, 20^th Annual ACM-SIAM Symposium on Discrete Algorithms
—To appear in The ACM Transactions on Algorithms

Plane Embedding of Planar Graph Metrics
with MohammadTaghi Hajiaghayi, Erik Demaine and Mohammad Moharrami
—SoCG 2006, 22^nd Annual ACM Symposium on Computational Geometry
—Journal of Discrete and Computational Geometry, Volume 38, Number 3, pp. 615-637