|
|
Amin SaberiAssistant Professor
|
I have also taught Introduction to Optimization (MS&E 111) and Combinatorial Optimization (MS&E 212).
S. Oveis Gharan, A. Saberi, Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus, 2009.
A. Asadpour, M. Goemans, A. Madry, S. Oveis Gharan, A. Saberi, An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem, SODA 2010. (best paper award)
A. Montanari, A. Saberi, Convergence to Equilibrium in Local Interaction Games, FOCS 2009.
N. Berger, C. Borgs, J. Chayes, A. Saberi, A Weak Local Limit for Preferential Attachment Graphs, preprint, 2009.
A. Asadpour, H. Nazerzadeh, and A. Saberi, Stochastic Submodular Maximization, journal version, 2009.
H. Nazerzadeh, A. Saberi, R. Vohra, Dynamic Cost-Per-Action Mechanisms and Applications to Online Advertising, WWW 2008, extended version to appear in Operations Research.
M. Bayati, A. Montanari and A. Saberi, Generating Random Graphs with Large Girth, SODA 2009. See also this paper on sequential algorithms for generating random graphs.
S. Lahaie, D. Pennock, A. Saberi, R. Vohra, Sponsored Search, Chapter 28, in Algorithmic Game Theory .
A. Mehta, A. Saberi, U. Vazirani, V. Vazirani, Adwords and Generalized On-line Matching, Journal of the ACM 2007 (conference version appeared in FOCS 2005). A SIAM News article by Sara Robinson on this work.
A. Asadpour, A. Saberi, An Approximation Algorithm for Max-min Fair Allocation of Indivisible Goods, STOC 07.
M. Mihail, C. Papadimitriou, and A. Saberi, On Certain Connectivity Properties of the Internet Topology, Journal of Computer and System Sciences 2006.
|
Terman Engineering Building, Room 317 Stanford, CA 94305 office: (650) 724 2052 cell: (650) 704 7857 | Assistant: Susan Burgenbauch Terman Engineering Building, Room 351 office: 650-725-1620 fax: (650) 723-8473 email: susanb@stanford.edu |