| 2012 | ||
|---|---|---|
| j15 | Minghong Lin, Adam Wierman, Alan Roytman, Adam Meyerson, Lachlan L. H. Andrew: Online optimization with switching cost. SIGMETRICS Performance Evaluation Review 40(3): 98-100 (2012) | |
| 2011 | ||
| j14 | Gunes Ercal, Rafit Izhak-Ratzin, Rupak Majumdar, Adam Meyerson: VCG with Communities on Random Ad Hoc Networks. IJDSN 2011 (2011) | |
| c39 | Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman: Bandwidth and Low Dimensional Embedding. APPROX-RANDOM 2011: 50-61 | |
| c38 | Michael Shindler, Alex Wong, Adam Meyerson: Fast and Accurate k-means For Large Datasets. NIPS 2011: 2375-2383 | |
| c37 | Vladimir Braverman, Adam Meyerson, Rafail Ostrovsky, Alan Roytman, Michael Shindler, Brian Tagiku: Streaming k-means on Well-Clusterable Data. SODA 2011: 26-40 | |
| i2 | David Felber, Adam Meyerson: Scheduling under Precedence, Communication, and Energy Constraints. CoRR abs/1105.5177 (2011) | |
| i1 | Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Jevan Saks, Ramesh K. Sitaraman: Algorithms for Constructing Overlay Networks For Live Streaming. CoRR abs/1109.4114 (2011) | |
| 2010 | ||
| c36 | Aaron Cote, Adam Meyerson, Brian Tagiku: Energy-efficient mobile data transport via online multi-network packet scheduling. Green Computing Conference 2010: 175-187 | |
| 2009 | ||
| j13 | Stephan Eidenbenz, Gunes Ercal-Ozkaya, Adam Meyerson, Allon G. Percus, Sarvesh Kumar Varatharajan: Incentive Compatible and Globally Efficient Position Based Routing for Selfish Reverse Multicast in Wireless Sensor Networks. Algorithms 2(4): 1303-1326 (2009) | |
| j12 | Sudipto Guha, Adam Meyerson, Kamesh Munagala: A Constant Factor Approximation for the Single Sink Edge Installation Problem. SIAM J. Comput. 38(6): 2426-2442 (2009) | |
| j11 | Konstantin Andreev, Charles Garrod, Daniel Golovin, Bruce M. Maggs, Adam Meyerson: Simultaneous source location. ACM Transactions on Algorithms 6(1) (2009) | |
| c35 | Douglas E. Carroll, Adam Meyerson, Brian Tagiku: Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs. APPROX-RANDOM 2009: 29-41 | |
| c34 | Adam Meyerson, Brian Tagiku: Minimizing Average Shortest Path Distances via Shortcut Edge Addition. APPROX-RANDOM 2009: 272-285 | |
| c33 | Suk-Bok Lee, Ioannis Pefkianakis, Adam Meyerson, Shugong Xu, Songwu Lu: Proportional Fair Frequency-Domain Packet Scheduling for 3GPP LTE Uplink. INFOCOM 2009: 2611-2615 | |
| c32 | Milan Bradonjic, Gunes Ercal-Ozkaya, Adam Meyerson, Alan Roytman: On the price of mediation. ACM Conference on Electronic Commerce 2009: 315-324 | |
| 2008 | ||
| j10 | Adam Meyerson, Kamesh Munagala, Serge A. Plotkin: Cost-Distance: Two Metric Network Design. SIAM J. Comput. 38(4): 1648-1659 (2008) | |
| c31 | Gunes Ercal, Rafit Izhak-Ratzin, Rupak Majumdar, Adam Meyerson: Frugal Routing on Wireless Ad-Hoc Networks. SAGT 2008: 133-144 | |
| c30 | Aaron Cote, Adam Meyerson, Laura J. Poplawski: Randomized k-server on hierarchical binary trees. STOC 2008: 227-234 | |
| 2007 | ||
| j9 | Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff: Approximation Algorithms for Orienteering and Discounted-Reward TSP. SIAM J. Comput. 37(2): 653-670 (2007) | |
| c29 | David Kempe, Adam Meyerson, Nainesh Solanki, Ramnath K. Chellappa: Pricing of partially compatible products. ACM Conference on Electronic Commerce 2007: 218-226 | |
| 2006 | ||
| j8 | Ashish Goel, Adam Meyerson: Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs. Algorithmica 44(4): 301-323 (2006) | |
| j7 | Mohit Lad, Daniel Massey, Adam Meyerson, Akash Nanavati, Lixia Zhang: Minimum failure explanations for path vector routing changes. J. Comb. Optim. 12(1-2): 5-16 (2006) | |
| c28 | Sven Koenig, Craig A. Tovey, Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pinar Keskinocak, Anton J. Kleywegt, Adam Meyerson, Sonal Jain: The Power of Sequential Single-Item Auctions for Agent Coordination. AAAI 2006: 1625-1629 | |
| c27 | Douglas E. Carroll, Ashish Goel, Adam Meyerson: Embedding Bounded Bandwidth Graphs into l1. ICALP (1) 2006: 27-37 | |
| c26 | Adam Meyerson, Akash Nanavati, Laura J. Poplawski: Randomized online algorithms for minimum metric bipartite matching. SODA 2006: 954-959 | |
| 2005 | ||
| j6 | Ashish Goel, Adam Meyerson, Serge A. Plotkin: Approximate majorization and fair online load balancing. ACM Transactions on Algorithms 1(2): 338-349 (2005) | |
| c25 | ||
| c24 | Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pinar Keskinocak, Anton J. Kleywegt, Sven Koenig, Craig A. Tovey, Adam Meyerson, Sonal Jain: Auction-Based Multi-Robot Routing. Robotics: Science and Systems 2005: 343-350 | |
| 2004 | ||
| j5 | Adam Meyerson, Liadan O'Callaghan, Serge A. Plotkin: A k-Median Algorithm with Running Time Independent of Data Size. Machine Learning 56(1-3): 61-87 (2004) | |
| j4 | Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit: Local Search Heuristics for k-Median and Facility Location Problems. SIAM J. Comput. 33(3): 544-562 (2004) | |
| c23 | Konstantin Andreev, Charles Garrod, Bruce M. Maggs, Adam Meyerson: Simultaneous Source Location. APPROX-RANDOM 2004: 13-26 | |
| c22 | ||
| c21 | ||
| c20 | Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson: Approximation algorithms for deadline-TSP and vehicle routing with time-windows. STOC 2004: 166-174 | |
| 2003 | ||
| j3 | Sudipto Guha, Adam Meyerson, Kamesh Munagala: A constant factor approximation algorithm for the fault-tolerant facility location problem. J. Algorithms 48(2): 429-440 (2003) | |
| j2 | Sudipto Guha, Adam Meyerson, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan: Clustering Data Streams: Theory and Practice. IEEE Trans. Knowl. Data Eng. 15(3): 515-528 (2003) | |
| c19 | Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff: Approximation Algorithms for Orienteering and Discounted-Reward TSP. FOCS 2003: 46-55 | |
| c18 | ||
| c17 | Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Ramesh K. Sitaraman: Designing overlay multicast networks for streaming. SPAA 2003: 149-158 | |
| c16 | Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy: Representing Graph Metrics with Fewest Edges. STACS 2003: 355-366 | |
| c15 | Baruch Awerbuch, Yossi Azar, Adam Meyerson: Reducing truth-telling online mechanisms to online optimization. STOC 2003: 503-510 | |
| 2002 | ||
| c14 | Liadan O'Callaghan, Adam Meyerson, Rajeev Motwani, Nina Mishra, Sudipto Guha: Streaming-Data Algorithms for High-Quality Clustering. ICDE 2002: 685-694 | |
| 2001 | ||
| j1 | Ashish Goel, Adam Meyerson, Serge A. Plotkin: Combining Fairness with Throughput: Online Routing with Multiple Objectives. J. Comput. Syst. Sci. 63(1): 62-79 (2001) | |
| c13 | Adam Meyerson, Kamesh Munagala, Serge A. Plotkin: Designing Networks Incrementally. FOCS 2001: 406-415 | |
| c12 | ||
| c11 | Rishi Bhargava, Ashish Goel, Adam Meyerson: Using approximate majorization to characterize protocol fairness. SIGMETRICS/Performance 2001: 330-331 | |
| c10 | Adam Meyerson, Kamesh Munagala, Serge A. Plotkin: Web caching using access statistics. SODA 2001: 354-363 | |
| c9 | Ashish Goel, Adam Meyerson, Serge A. Plotkin: Approximate majorization and fair online load balancing. SODA 2001: 384-390 | |
| c8 | Ashish Goel, Adam Meyerson, Serge A. Plotkin: Distributed admission control, scheduling, and routing with stale information. SODA 2001: 611-619 | |
| c7 | Sudipto Guha, Adam Meyerson, Kamesh Munagala: Improved algorithms for fault tolerant facility location. SODA 2001: 636-641 | |
| c6 | Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit: Local search heuristic for k-median and facility location problems. STOC 2001: 21-29 | |
| c5 | ||
| c4 | Sudipto Guha, Adam Meyerson, Kamesh Munagala: A constant factor approximation for the single sink edge installation problems. STOC 2001: 383-388 | |
| 2000 | ||
| c3 | Sudipto Guha, Adam Meyerson, Kamesh Munagala: Hierarchical Placement and Network Design Problems. FOCS 2000: 603-612 | |
| c2 | Adam Meyerson, Kamesh Munagala, Serge A. Plotkin: Cost-Distance: Two Metric Network Design. FOCS 2000: 624-630 | |
| c1 | Ashish Goel, Adam Meyerson, Serge A. Plotkin: Combining fairness with throughput: online routing with multiple objectives. STOC 2000: 670-679 | |
Data released under the ODC-BY 1.0 license — See also our legal information page