default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdam Meyerson
Person information
- affiliation: University of California, Los Angeles, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j19]Madhukar R. Korupolu, Adam Meyerson, Rajmohan Rajaraman, Brian Tagiku:
Coupled and k-sided placements: generalizing generalized assignment. Math. Program. 154(1-2): 493-514 (2015)- [i3]Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman:
A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret. CoRR abs/1508.03769 (2015) - 2014
- [j18]Milan Bradonjic, Gunes Ercal, Adam Meyerson, Alan Roytman:
The Price of Mediation. Discret. Math. Theor. Comput. Sci. 16(1): 31-60 (2014) - [c44]Madhukar R. Korupolu, Adam Meyerson, Rajmohan Rajaraman, Brian Tagiku:
Coupled and k-Sided Placements: Generalizing Generalized Assignment. IPCO 2014: 357-368 - 2013
- [j17]Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman:
Bandwidth and low dimensional embedding. Theor. Comput. Sci. 500: 44-56 (2013) - [c43]Adam Meyerson, Alan Roytman, Brian Tagiku:
Online Multidimensional Load Balancing. APPROX-RANDOM 2013: 287-302 - [c42]Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman:
A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret. COLT 2013: 741-763 - [c41]Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman:
A tale of two metrics: simultaneous bounds on competitiveness and regret. SIGMETRICS 2013: 329-330 - 2012
- [j16]Minghong Lin, Adam Wierman, Alan Roytman, Adam Meyerson, Lachlan L. H. Andrew:
Online optimization with switching cost. SIGMETRICS Perform. Evaluation Rev. 40(3): 98-100 (2012) - 2011
- [j15]Gunes Ercal, Rafit Izhak-Ratzin, Rupak Majumdar, Adam Meyerson:
VCG with Communities on Random Ad Hoc Networks. Int. J. Distributed Sens. Networks 7(1) (2011) - [j14]Aaron Cote, Adam Meyerson, Brian Tagiku:
Energy-efficient mobile data transport via online multi-network packet scheduling. Sustain. Comput. Informatics Syst. 1(3): 196-212 (2011) - [c40]Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman:
Bandwidth and Low Dimensional Embedding. APPROX-RANDOM 2011: 50-61 - [c39]Michael Shindler, Alex Wong, Adam Meyerson:
Fast and Accurate k-means For Large Datasets. NIPS 2011: 2375-2383 - [c38]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
- [c37]Aaron Cote, Adam Meyerson, Brian Tagiku:
Energy-efficient mobile data transport via online multi-network packet scheduling. Green Computing Conference 2010: 175-187
2000 – 2009
- 2009
- [j13]Stephan J. 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 Trans. Algorithms 6(1): 16:1-16:17 (2009) - [c36]Douglas E. Carroll, Adam Meyerson, Brian Tagiku:
Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs. APPROX-RANDOM 2009: 29-41 - [c35]Adam Meyerson, Brian Tagiku:
Minimizing Average Shortest Path Distances via Shortcut Edge Addition. APPROX-RANDOM 2009: 272-285 - [c34]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 - [c33]Stephan J. Eidenbenz
, Gunes Ercal-Ozkaya, Adam Meyerson, Allon G. Percus:
On a locally minimum cost forwarding game. FOWANC@MobiHoc 2009: 29-36 - [c32]Milan Bradonjic, Gunes Ercal-Ozkaya, Adam Meyerson, Alan Roytman:
On the price of mediation. EC 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. EC 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 Trans. Algorithms 1(2): 338-349 (2005) - [c25]Adam Meyerson:
The Parking Permit Problem. FOCS 2005: 274-284 - [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. Mach. Learn. 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]Adam Meyerson, Ryan Williams:
On the Complexity of Optimal K-Anonymity. PODS 2004: 223-228 - [c21]Adam Meyerson:
Online algorithms for network design. SPAA 2004: 275-280 - [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]Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson:
Online oblivious routing. SPAA 2003: 44-49 - [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
- [b1]Adam Meyerson:
Approximation algorithms for network design problems. Stanford University, USA, 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]Adam Meyerson:
Online Facility Location. FOCS 2001: 426-431 - [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]Adam Meyerson:
Profit-earning facility location. STOC 2001: 30-36 - [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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
