Aaron Archer

Aaron is a Research Scientist at Google NYC, where he leads the Large-Scale Optimization research team. He came to Google in 2013 after 9+ years in the Algorithms and Optimization department at the AT&T Shannon Research Laboratory. Aaron earned degrees in Operations Research (masters 2002, PhD 2004) from Cornell University, where he was advised by Eva Tardos and supported by a Hertz Fellowship. Prior to that, he earned his bachelors degree in Mathematics (1998) from Harvey Mudd College, where he graduated first in his class. Aaron has pursued theoretical, experimental and applied research in diverse areas including mathematical programming (e.g., linear, integer, and convex programming), approximation algorithms, graph algorithms, algorithmic game theory, online algorithms, network design, load balancing, and unsupervised machine learning (e.g., clustering). He particularly enjoys finding effective ways to model complex real-world optimization problems. His primary mission at Google has been to apply these and other techniques to improve the efficiency of Google's computational infrastructure. Aaron has also made small forays into graphics, machine vision, combinatorics, graph theory, computational ecology, and mathematical rap.

Google Publications

Previous Publications

  •  

    Content placement via the exponential potential function method

    David Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K.K. Ramakrishnan

    Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Springer, pp. 49-61

  •  

    Combining predictors for recommending music: the False Positives' approach to KDD Cup track 2

    Suhrid Balakrishnan, Rensheng Wang, Carlos Eduardo Scheidegger, Angus MacLellan, Yifan Hu, Aaron Archer, Shankar Krishnan, David Applegate, Guangqin Ma, S. Tom Au

    JMLR Proceedings, vol. 18 (2012), pp. 199-213

  •  

    Leveraging video viewing patterns for optimal content placement

    Kyung-Wook Hwang, David Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, Vishal Misra, K. K. Ramakrishnan, Deborah F. Swayne

    NETWORKING 2012 - 11th International IFIP TC 6 Networking Conference Proceedings, Part II, pp. 44-58

  •  

    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

  •  

    Improved approximation algorithms for the minimum latency problem via prize-collecting strolls

    Aaron Archer, Anna Blasiak

    Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, SIAM, pp. 429-447

  •  

    Voting power and target-based site prioritization

    Steven J. Phillips, Aaron Archer, Robert L. Pressey, Desmond Torkornoo, David Applegate, David Johnson, Matthew E. Watts

    Biological Conservation, vol. 143 (2010), pp. 1989-1997

  •  

    A faster, better approximation algorithm for the minimum latency problem

    Aaron Archer, Asaf Levin, David P. Williamson

    SIAM Journal on Computing, vol. 37 (2008), pp. 1472-1498

  •  

    Characterizing truthful mechanisms with convex type spaces

    Aaron Archer, Robert Kleinberg

    SIGecom Exchanges, vol. 7 (2008)

  •  

    Importance sampling via load-balanced facility location

    Aaron Archer, Shankar Krishnan

    Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Springer, pp. 316-330

  •  

    Optimizing dispersal corridors for the Cape Proteaceae using network flow

    Steven J. Phillips, Paul Williams, Guy Midgley, Aaron Archer

    Ecological Applications, vol. 18 (2008), pp. 1200-1211

  •  

    Frugal path mechanisms

    Aaron Archer, Eva Tardos

    ACM Transactions on Algorithms, vol. 3 (2007)

  •  

    The 15 puzzle: How it drove the world crazy, by Jerry Slocum and Dic Sonneveld [book review]

    Aaron Archer

    Mathematical Intelligencer, vol. 29 (2007), pp. 83-85

  •  

    Approximate classification via earthmover metrics

    Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Eva Tardos

    Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, SIAM, pp. 1079-1087

  •  

    Approximation and collusion in multicast cost sharing

    Aaron Archer, Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker

    Games and Economic Behavior, vol. 47 (2004), pp. 36-71

  •  

    An approximate truthful mechanism for combinatorial auctions with single parameter agents

    Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Eva Tardos

    Internet Mathematics, vol. 1 (2003), pp. 129-150

  •  

    Lagrangian relaxation for the k-median problem: new insights and continuity properties

    Aaron Archer, Ranjithkumar Rajagopalan, David B. Shmoys

    Algorithms - ESA 2003, 11th Annual European Symposium, Springer, pp. 31-42

  •  

    March Mathness: an analysis of a nonstandard basketball pool

    Aaron Archer, Rick Cleary, Robin Lock, John Trono

    Math Horizons (2001), pp. 17-21

  •  

    Truthful mechanisms for one-parameter agents

    Aaron Archer, Eva Tardos

    42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, pp. 482-491

  •  

    Two O(log* k)-approximation algorithms for the asymmetric k-center problem

    Aaron Archer

    Integer Programming and Combinatorial Optimization, 8th International IPCO Conference (2001), pp. 1-14

  •  

    On the upper chromatic numbers of the reals

    Aaron Archer

    Discrete Mathematics, vol. 214 (2000), pp. 65-75

  •  

    A modern treatment of the 15 puzzle

    Aaron Archer

    American Mathematical Monthly, vol. 106 (1999), pp. 793-799

  •  

    A case for stricter grading

    Aaron F. Archer, Andrew D. Hutchings, Brian Johnson

    UMAP Journal, vol. 19 (1998), pp. 299-313