Adam Meyerson

According to our database1, Adam Meyerson authored at least 64 papers between 2000 and 2015.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2015
Coupled and k-sided placements: generalizing generalized assignment.
Math. Program., 2015

A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret.
CoRR, 2015

2014
The Price of Mediation.
Discrete Mathematics & Theoretical Computer Science, 2014

Coupled and k-Sided Placements: Generalizing Generalized Assignment.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013
Bandwidth and low dimensional embedding.
Theor. Comput. Sci., 2013

A tale of two metrics: simultaneous bounds on competitiveness and regret.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2013

A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret.
Proceedings of the COLT 2013, 2013

Online Multidimensional Load Balancing.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Online optimization with switching cost.
SIGMETRICS Performance Evaluation Review, 2012

2011
VCG with Communities on Random Ad Hoc Networks.
IJDSN, 2011

Algorithms for Constructing Overlay Networks For Live Streaming
CoRR, 2011

Scheduling under Precedence, Communication, and Energy Constraints
CoRR, 2011

Streaming k-means on Well-Clusterable Data.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Fast and Accurate k-means For Large Datasets.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Bandwidth and Low Dimensional Embedding.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Energy-efficient mobile data transport via online multi-network packet scheduling.
Proceedings of the International Green Computing Conference 2010, 2010

2009
Simultaneous source location.
ACM Trans. Algorithms, 2009

A Constant Factor Approximation for the Single Sink Edge Installation Problem.
SIAM J. Comput., 2009

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

On the price of mediation.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Proportional Fair Frequency-Domain Packet Scheduling for 3GPP LTE Uplink.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Minimizing Average Shortest Path Distances via Shortcut Edge Addition.
Proceedings of the Approximation, 2009

Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs.
Proceedings of the Approximation, 2009

2008
Cost-Distance: Two Metric Network Design.
SIAM J. Comput., 2008

Randomized k-server on hierarchical binary trees.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Frugal Routing on Wireless Ad-Hoc Networks.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007
Approximation Algorithms for Orienteering and Discounted-Reward TSP.
SIAM J. Comput., 2007

Pricing of partially compatible products.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

2006
Minimum failure explanations for path vector routing changes.
J. Comb. Optim., 2006

Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs.
Algorithmica, 2006

Randomized online algorithms for minimum metric bipartite matching.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Embedding Bounded Bandwidth Graphs into l1.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

The Power of Sequential Single-Item Auctions for Agent Coordination.
Proceedings of the Proceedings, 2006

2005
Approximate majorization and fair online load balancing.
ACM Trans. Algorithms, 2005

Auction-Based Multi-Robot Routing.
Proceedings of the Robotics: Science and Systems I, 2005

The Parking Permit Problem.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
Local Search Heuristics for k-Median and Facility Location Problems.
SIAM J. Comput., 2004

A k-Median Algorithm with Running Time Independent of Data Size.
Machine Learning, 2004

Approximation algorithms for deadline-TSP and vehicle routing with time-windows.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Online algorithms for network design.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

On the Complexity of Optimal K-Anonymity.
Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

Simultaneous Source Location.
Proceedings of the Approximation, 2004

2003
Clustering Data Streams: Theory and Practice.
IEEE Trans. Knowl. Data Eng., 2003

A constant factor approximation algorithm for the fault-tolerant facility location problem.
J. Algorithms, 2003

Reducing truth-telling online mechanisms to online optimization.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Representing Graph Metrics with Fewest Edges.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Online oblivious routing.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Designing overlay multicast networks for streaming.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Approximation Algorithms for Orienteering and Discounted-Reward TSP.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002
Streaming-Data Algorithms for High-Quality Clustering.
Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002

2001
Combining Fairness with Throughput: Online Routing with Multiple Objectives.
J. Comput. Syst. Sci., 2001

Profit-earning facility location.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

A constant factor approximation for the single sink edge installation problems.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Local search heuristic for k-median and facility location problems.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Web caching using access statistics.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Improved algorithms for fault tolerant facility location.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Distributed admission control, scheduling, and routing with stale information.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Approximate majorization and fair online load balancing.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Using approximate majorization to characterize protocol fairness.
Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 2001

Designing Networks Incrementally.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Online Facility Location.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
Combining fairness with throughput: online routing with multiple objectives.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Cost-Distance: Two Metric Network Design.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Hierarchical Placement and Network Design Problems.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000


  Loading...