Adam Meyerson

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
54Bandwidth and Low Dimensional Embedding. Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman. APPROX-RANDOM 2011, 50-61. Web SearchBibTeXDownload
53Algorithms for Constructing Overlay Networks For Live Streaming. Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Jevan Saks, Ramesh K. Sitaraman. CoRR (abs/1109.4114) (2011). Web SearchBibTeXDownload
52Scheduling under Precedence, Communication, and Energy Constraints. David Felber, Adam Meyerson. CoRR (abs/1105.5177) (2011). Web SearchBibTeXDownload
51VCG with Communities on Random Ad Hoc Networks. Gunes Ercal, Rafit Izhak-Ratzin, Rupak Majumdar, Adam Meyerson. IJDSN (2011) (2011). Web SearchBibTeXDownload
50Streaming k-means on Well-Clusterable Data. Vladimir Braverman, Adam Meyerson, Rafail Ostrovsky, Alan Roytman, Michael Shindler, Brian Tagiku. SODA 2011, 26-40. Web SearchBibTeXDownload
2010
49Energy-efficient mobile data transport via online multi-network packet scheduling. Aaron Cote, Adam Meyerson, Brian Tagiku. Green Computing Conference 2010, 175-187. Web SearchBibTeXDownload
2009
48On the price of mediation. Milan Bradonjic, Gunes Ercal-Ozkaya, Adam Meyerson, Alan Roytman. ACM Conference on Electronic Commerce 2009, 315-324. Web SearchBibTeXDownload
47Simultaneous source location. Konstantin Andreev, Charles Garrod, Daniel Golovin, Bruce M. Maggs, Adam Meyerson. ACM Transactions on Algorithms (6) (2009). Web SearchBibTeXDownload
46Incentive Compatible and Globally Efficient Position Based Routing for Selfish Reverse Multicast in Wireless Sensor Networks. Stephan Eidenbenz, Gunes Ercal-Ozkaya, Adam Meyerson, Allon Percus, Sarvesh Kumar Varatharajan. Algorithms (2): 1303-1326 (2009). Web SearchBibTeXDownload
45Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs. Douglas E. Carroll, Adam Meyerson, Brian Tagiku. APPROX-RANDOM 2009, 29-41. Web SearchBibTeXDownload
44Minimizing Average Shortest Path Distances via Shortcut Edge Addition. Adam Meyerson, Brian Tagiku. APPROX-RANDOM 2009, 272-285. Web SearchBibTeXDownload
43Proportional Fair Frequency-Domain Packet Scheduling for 3GPP LTE Uplink. Suk-Bok Lee, Ioannis Pefkianakis, Adam Meyerson, Shugong Xu, Songwu Lu. INFOCOM 2009, 2611-2615. Web SearchBibTeXDownload
42A Constant Factor Approximation for the Single Sink Edge Installation Problem. Sudipto Guha, Adam Meyerson, Kamesh Munagala. SIAM J. Comput. (38): 2426-2442 (2009). Cited by 5Web SearchBibTeXDownload
2008
41Frugal Routing on Wireless Ad-Hoc Networks. Gunes Ercal, Rafit Izhak-Ratzin, Rupak Majumdar, Adam Meyerson. SAGT 2008, 133-144. Web SearchBibTeXDownload
40Cost-Distance: Two Metric Network Design. Adam Meyerson, Kamesh Munagala, Serge A. Plotkin. SIAM J. Comput. (38): 1648-1659 (2008). Web SearchBibTeXDownload
39Randomized k-server on hierarchical binary trees. Aaron Cote, Adam Meyerson, Laura J. Poplawski. STOC 2008, 227-234. Web SearchBibTeXDownload
2007
38Pricing of partially compatible products. David Kempe, Adam Meyerson, Nainesh Solanki, Ramnath Chellappa. ACM Conference on Electronic Commerce 2007, 218-226. Web SearchBibTeXDownload
37Approximation Algorithms for Orienteering and Discounted-Reward TSP. Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff. SIAM J. Comput. (37): 653-670 (2007). Web SearchBibTeXDownload
2006
36The 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. Web SearchBibTeX
35Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs. Ashish Goel, Adam Meyerson. Algorithmica (44): 301-323 (2006). Web SearchBibTeXDownload
34Embedding Bounded Bandwidth Graphs into l1. Douglas E. Carroll, Ashish Goel, Adam Meyerson. ICALP (1) 2006, 27-37. Web SearchBibTeXDownload
33Minimum failure explanations for path vector routing changes. Mohit Lad, Daniel Massey, Adam Meyerson, Akash Nanavati, Lixia Zhang. J. Comb. Optim. (12): 5-16 (2006). Web SearchBibTeXDownload
32Randomized online algorithms for minimum metric bipartite matching. Adam Meyerson, Akash Nanavati, Laura J. Poplawski. SODA 2006, 954-959. Web SearchBibTeXDownload
2005
31Approximate majorization and fair online load balancing. Ashish Goel, Adam Meyerson, Serge A. Plotkin. ACM Transactions on Algorithms (1): 338-349 (2005). Web SearchBibTeXDownload
30The Parking Permit Problem. Adam Meyerson. FOCS 2005, 274-284. Web SearchBibTeXDownload
29Auction-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, 343-350. Web SearchBibTeXDownload
2004
28Simultaneous Source Location. Konstantin Andreev, Charles Garrod, Bruce M. Maggs, Adam Meyerson. APPROX-RANDOM 2004, 13-26. Web SearchBibTeXDownload
27A k-Median Algorithm with Running Time Independent of Data Size. Adam Meyerson, Liadan O'Callaghan, Serge A. Plotkin. Machine Learning (56): 61-87 (2004). Cited by 15Web SearchBibTeXDownload
26On the Complexity of Optimal K-Anonymity. Adam Meyerson, Ryan Williams. PODS 2004, 223-228. Web SearchBibTeXDownload
25Local Search Heuristics for k-Median and Facility Location Problems. Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit. SIAM J. Comput. (33): 544-562 (2004). Web SearchBibTeXDownload
24Online algorithms for network design. Adam Meyerson. SPAA 2004, 275-280. Web SearchBibTeXDownload
23Approximation algorithms for deadline-TSP and vehicle routing with time-windows. Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson. STOC 2004, 166-174. Web SearchBibTeXDownload
2003
22Approximation Algorithms for Orienteering and Discounted-Reward TSP. Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff. FOCS 2003, 46-55. Web SearchBibTeXDownload
21Clustering Data Streams: Theory and Practice. Sudipto Guha, Adam Meyerson, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan. IEEE Trans. Knowl. Data Eng. (15): 515-528 (2003). Cited by 652Web SearchBibTeXDownload
20A constant factor approximation algorithm for the fault-tolerant facility location problem. Sudipto Guha, Adam Meyerson, Kamesh Munagala. J. Algorithms (48): 429-440 (2003). Cited by 14Web SearchBibTeXDownload
19Online oblivious routing. Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson. SPAA 2003, 44-49. Web SearchBibTeXDownload
18Designing overlay multicast networks for streaming. Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Ramesh K. Sitaraman. SPAA 2003, 149-158. Web SearchBibTeXDownload
17Representing Graph Metrics with Fewest Edges. Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy. STACS 2003, 355-366. Cited by 5Web SearchBibTeXDownload
16Reducing truth-telling online mechanisms to online optimization. Baruch Awerbuch, Yossi Azar, Adam Meyerson. STOC 2003, 503-510. Web SearchBibTeXDownload
2002
15Streaming-Data Algorithms for High-Quality Clustering. Liadan O'Callaghan, Adam Meyerson, Rajeev Motwani, Nina Mishra, Sudipto Guha. ICDE 2002, 685-694. Cited by 231Web SearchBibTeXDownload
2001
14Designing Networks Incrementally. Adam Meyerson, Kamesh Munagala, Serge A. Plotkin. FOCS 2001, 406-415. Web SearchBibTeXDownload
13Online Facility Location. Adam Meyerson. FOCS 2001, 426-431. Web SearchBibTeXDownload
12Combining Fairness with Throughput: Online Routing with Multiple Objectives. Ashish Goel, Adam Meyerson, Serge A. Plotkin. J. Comput. Syst. Sci. (63): 62-79 (2001). Web SearchBibTeXDownload
11Using approximate majorization to characterize protocol fairness. Rishi Bhargava, Ashish Goel, Adam Meyerson. SIGMETRICS/Performance 2001, 330-331. Web SearchBibTeXDownload
10Distributed admission control, scheduling, and routing with stale information. Ashish Goel, Adam Meyerson, Serge A. Plotkin. SODA 2001, 611-619. Web SearchBibTeXDownload
9Approximate majorization and fair online load balancing. Ashish Goel, Adam Meyerson, Serge A. Plotkin. SODA 2001, 384-390. Web SearchBibTeXDownload
8Improved algorithms for fault tolerant facility location. Sudipto Guha, Adam Meyerson, Kamesh Munagala. SODA 2001, 636-641. Cited by 23Web SearchBibTeXDownload
7Web caching using access statistics. Adam Meyerson, Kamesh Munagala, Serge A. Plotkin. SODA 2001, 354-363. Web SearchBibTeXDownload
6A constant factor approximation for the single sink edge installation problems. Sudipto Guha, Adam Meyerson, Kamesh Munagala. STOC 2001, 383-388. Cited by 60Web SearchBibTeXDownload
5Local search heuristic for k-median and facility location problems. Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit. STOC 2001, 21-29. Web SearchBibTeXDownload
4Profit-earning facility location. Adam Meyerson. STOC 2001, 30-36. Web SearchBibTeXDownload
2000
3Cost-Distance: Two Metric Network Design. Adam Meyerson, Kamesh Munagala, Serge A. Plotkin. FOCS 2000, 624-630. Web SearchBibTeXDownload
2Hierarchical Placement and Network Design Problems. Sudipto Guha, Adam Meyerson, Kamesh Munagala. FOCS 2000, 603-612. Cited by 89Web SearchBibTeXDownload
1Combining fairness with throughput: online routing with multiple objectives. Ashish Goel, Adam Meyerson, Serge A. Plotkin. STOC 2000, 670-679. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research