Adam Meyerson

BS MIT 1997 (Math and CS double major), PhD Stanford 2002 (CS, advised by Dr. Serge Plotkin), ALADDIN Postdoc at CMU from 2002-2003, Assistant Professor at UCLA from 2003-2011. Joined Google Inc. 2011 (Dynamic Search Ads Team).

Google Publications

Previous Publications

  •  

    A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret

    Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman

    COLT (2013), pp. 741-763

  •  

    A tale of two metrics: simultaneous bounds on competitiveness and regret

    Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman

    SIGMETRICS (2013), pp. 329-330

  •  

    Bandwidth and low dimensional embedding

    Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman

    Theor. Comput. Sci., vol. 500 (2013), pp. 44-56

  •  

    Online Multidimensional Load Balancing

    Adam Meyerson, Alan Roytman, Brian Tagiku

    APPROX-RANDOM (2013), pp. 287-302

  •  

    Online optimization with switching cost

    Minghong Lin, Adam Wierman, Alan Roytman, Adam Meyerson, Lachlan L. H. Andrew

    SIGMETRICS Performance Evaluation Review, vol. 40 (2012), pp. 98-100

  •  

    Algorithms for Constructing Overlay Networks For Live Streaming

    Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Jevan Saks, Ramesh K. Sitaraman

    CoRR, vol. abs/1109.4114 (2011)

  •  

    Bandwidth and Low Dimensional Embedding

    Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman

    APPROX-RANDOM (2011), pp. 50-61

  •  

    Fast and Accurate k-means For Large Datasets

    Michael Shindler, Alex Wong, Adam Meyerson

    NIPS (2011), pp. 2375-2383

  •  

    Scheduling under Precedence, Communication, and Energy Constraints

    David Felber, Adam Meyerson

    CoRR, vol. abs/1105.5177 (2011)

  •  

    Streaming k-means on Well-Clusterable Data

    Vladimir Braverman, Adam Meyerson, Rafail Ostrovsky, Alan Roytman, Michael Shindler, Brian Tagiku

    SODA (2011), pp. 26-40

  •  

    VCG with Communities on Random Ad Hoc Networks

    Gunes Ercal, Rafit Izhak-Ratzin, Rupak Majumdar, Adam Meyerson

    IJDSN, vol. 2011 (2011)

  •  

    Energy-efficient mobile data transport via online multi-network packet scheduling

    Aaron Cote, Adam Meyerson, Brian Tagiku

    Green Computing Conference (2010), pp. 175-187

  •  

    A Constant Factor Approximation for the Single Sink Edge Installation Problem

    Sudipto Guha, Adam Meyerson, Kamesh Munagala

    SIAM J. Comput., vol. 38 (2009), pp. 2426-2442

  •  

    Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs

    Douglas E. Carroll, Adam Meyerson, Brian Tagiku

    APPROX-RANDOM (2009), pp. 29-41

  •  

    Incentive Compatible and Globally Efficient Position Based Routing for Selfish Reverse Multicast in Wireless Sensor Networks

    Stephan Eidenbenz, Gunes Ercal-Ozkaya, Adam Meyerson, Allon G. Percus, Sarvesh Kumar Varatharajan

    Algorithms, vol. 2 (2009), pp. 1303-1326

  •  

    Minimizing Average Shortest Path Distances via Shortcut Edge Addition

    Adam Meyerson, Brian Tagiku

    APPROX-RANDOM (2009), pp. 272-285

  •  

    On the price of mediation

    Milan Bradonjic, Gunes Ercal-Ozkaya, Adam Meyerson, Alan Roytman

    ACM Conference on Electronic Commerce (2009), pp. 315-324

  •  

    Proportional Fair Frequency-Domain Packet Scheduling for 3GPP LTE Uplink

    Suk-Bok Lee, Ioannis Pefkianakis, Adam Meyerson, Shugong Xu, Songwu Lu

    INFOCOM (2009), pp. 2611-2615

  •  

    Simultaneous source location

    Konstantin Andreev, Charles Garrod, Daniel Golovin, Bruce M. Maggs, Adam Meyerson

    ACM Transactions on Algorithms, vol. 6 (2009)

  •  

    Cost-Distance: Two Metric Network Design

    Adam Meyerson, Kamesh Munagala, Serge A. Plotkin

    SIAM J. Comput., vol. 38 (2008), pp. 1648-1659

  •  

    Frugal Routing on Wireless Ad-Hoc Networks

    Gunes Ercal, Rafit Izhak-Ratzin, Rupak Majumdar, Adam Meyerson

    SAGT (2008), pp. 133-144

  •  

    Randomized k-server on hierarchical binary trees

    Aaron Cote, Adam Meyerson, Laura J. Poplawski

    STOC (2008), pp. 227-234

  •  

    Pricing of partially compatible products

    David Kempe, Adam Meyerson, Nainesh Solanki, Ramnath K. Chellappa

    ACM Conference on Electronic Commerce (2007), pp. 218-226

  •  

    Embedding Bounded Bandwidth Graphs into l1

    Douglas E. Carroll, Ashish Goel, Adam Meyerson

    ICALP (1) (2006), pp. 27-37

  •  

    Minimum failure explanations for path vector routing changes

    Mohit Lad, Daniel Massey, Adam Meyerson, Akash Nanavati, Lixia Zhang 0001

    J. Comb. Optim., vol. 12 (2006), pp. 5-16

  •   

    Randomized online algorithms for minimum metric bipartite matching

    Adam Meyerson, Akash Nanavati, Laura Poplawski

    SODA (2006), pp. 954-959

  •  

    Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs

    Ashish Goel, Adam Meyerson

    Algorithmica, vol. 44 (2006), pp. 301-323

  •  

    The Power of Sequential Single-Item Auctions for Agent Coordination

    Sven Koenig, Craig A. Tovey, Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pinar Keskinocak, Anton J. Kleywegt, Adam Meyerson, Sonal Jain

    AAAI (2006), pp. 1625-1629

  •  

    Approximate majorization and fair online load balancing

    Ashish Goel, Adam Meyerson, Serge A. Plotkin

    ACM Transactions on Algorithms, vol. 1 (2005), pp. 338-349

  •  

    Auction-Based Multi-Robot Routing

    Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pinar Keskinocak, Anton J. Kleywegt, Sven Koenig, Craig A. Tovey, Adam Meyerson, Sonal Jain

    Robotics: Science and Systems (2005), pp. 343-350

  •  

    The Parking Permit Problem

    Adam Meyerson

    FOCS (2005), pp. 274-284

  •  

    A k-Median Algorithm with Running Time Independent of Data Size

    Adam Meyerson, Liadan O'Callaghan, Serge A. Plotkin

    Machine Learning, vol. 56 (2004), pp. 61-87

  •  

    Approximation algorithms for deadline-TSP and vehicle routing with time-windows

    Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson

    STOC (2004), pp. 166-174

  •  

    Local Search Heuristics for k-Median and Facility Location Problems

    Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit

    SIAM J. Comput., vol. 33 (2004), pp. 544-562

  •  

    On the Complexity of Optimal K-Anonymity

    Adam Meyerson, Ryan Williams

    PODS (2004), pp. 223-228

  •  

    Online algorithms for network design

    Adam Meyerson

    SPAA (2004), pp. 275-280

  •  

    Simultaneous Source Location

    Konstantin Andreev, Charles Garrod, Bruce M. Maggs, Adam Meyerson

    APPROX-RANDOM (2004), pp. 13-26

  •  

    A constant factor approximation algorithm for the fault-tolerant facility location problem

    Sudipto Guha, Adam Meyerson, Kamesh Munagala

    J. Algorithms, vol. 48 (2003), pp. 429-440

  •  

    Designing overlay multicast networks for streaming

    Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Ramesh K. Sitaraman

    SPAA (2003), pp. 149-158

  •  

    Online oblivious routing

    Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson

    SPAA (2003), pp. 44-49

  •  

    Reducing truth-telling online mechanisms to online optimization

    Baruch Awerbuch, Yossi Azar, Adam Meyerson

    STOC (2003), pp. 503-510

  •  

    A constant factor approximation for the single sink edge installation problems

    Sudipto Guha, Adam Meyerson, Kamesh Munagala

    STOC (2001), pp. 383-388

  •  

    Approximate majorization and fair online load balancing

    Ashish Goel, Adam Meyerson, Serge A. Plotkin

    SODA (2001), pp. 384-390

  •  

    Combining Fairness with Throughput: Online Routing with Multiple Objectives

    Ashish Goel, Adam Meyerson, Serge A. Plotkin

    J. Comput. Syst. Sci., vol. 63 (2001), pp. 62-79

  •  

    Designing Networks Incrementally

    Adam Meyerson, Kamesh Munagala, Serge A. Plotkin

    FOCS (2001), pp. 406-415

  •  

    Distributed admission control, scheduling, and routing with stale information

    Ashish Goel, Adam Meyerson, Serge A. Plotkin

    SODA (2001), pp. 611-619

  •  

    Improved algorithms for fault tolerant facility location

    Sudipto Guha, Adam Meyerson, Kamesh Munagala

    SODA (2001), pp. 636-641

  •  

    Local search heuristic for k-median and facility location problems

    Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit

    STOC (2001), pp. 21-29

  •  

    Online Facility Location

    Adam Meyerson

    FOCS (2001), pp. 426-431

  •  

    Profit-earning facility location

    Adam Meyerson

    STOC (2001), pp. 30-36

  •  

    Using approximate majorization to characterize protocol fairness

    Rishi Bhargava, Ashish Goel, Adam Meyerson

    SIGMETRICS/Performance (2001), pp. 330-331

  •  

    Web caching using access statistics

    Adam Meyerson, Kamesh Munagala, Serge A. Plotkin

    SODA (2001), pp. 354-363

  •  

    Combining fairness with throughput: online routing with multiple objectives

    Ashish Goel, Adam Meyerson, Serge A. Plotkin

    STOC (2000), pp. 670-679

  •  

    Cost-Distance: Two Metric Network Design

    Adam Meyerson, Kamesh Munagala, Serge A. Plotkin

    FOCS (2000), pp. 624-630

  •  

    Hierarchical Placement and Network Design Problems

    Sudipto Guha, Adam Meyerson, Kamesh Munagala

    FOCS (2000), pp. 603-612