Adam Meyerson

Sarvesh Kumar Varatharajan

SIAM J. Comput., 2009

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

[BibT_eX]

[DOI]

Algorithms, 2009

On a locally minimum cost forwarding game.

[BibT_eX]

[DOI]

Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing, 2009

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

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Minimizing Average Shortest Path Distances via Shortcut Edge Addition.

[BibT_eX]

[DOI]

Brian Tagiku

Proceedings of the Approximation, 2009

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

[BibT_eX]

[DOI]

Douglas E. Carroll

Brian Tagiku

Proceedings of the Approximation, 2009

2008

Cost-Distance: Two Metric Network Design.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Randomized k-server on hierarchical binary trees.

[BibT_eX]

[DOI]

Aaron Cote

Laura J. Poplawski

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Frugal Routing on Wireless Ad-Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007

Approximation Algorithms for Orienteering and Discounted-Reward TSP.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Pricing of partially compatible products.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

2006

Minimum failure explanations for path vector routing changes.

[BibT_eX]

[DOI]

J. Comb. Optim., 2006

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

[BibT_eX]

[DOI]

Algorithmica, 2006

Randomized online algorithms for minimum metric bipartite matching.

[BibT_eX]

[DOI]

Akash Nanavati

Laura J. Poplawski

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Embedding Bounded Bandwidth Graphs into l<sub>1</sub>.

[BibT_eX]

[DOI]

Douglas E. Carroll

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

The Power of Sequential Single-Item Auctions for Agent Coordination.

[BibT_eX]

[DOI]

Sven Koenig

Craig A. Tovey

Michail G. Lagoudakis

Proceedings of the Proceedings, 2006

2005

Approximate majorization and fair online load balancing.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2005

Auction-Based Multi-Robot Routing.

[BibT_eX]

[DOI]

Michail G. Lagoudakis

Proceedings of the Robotics: Science and Systems I, 2005

The Parking Permit Problem.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

A <i>k</i>-Median Algorithm with Running Time Independent of Data Size.

[BibT_eX]

[DOI]

Liadan O'Callaghan

Mach. Learn., 2004

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

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Online algorithms for network design.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Ryan Williams

Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004

Simultaneous Source Location.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2004

2003

Clustering Data Streams: Theory and Practice.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2003

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

[BibT_eX]

[DOI]

J. Algorithms, 2003

Reducing truth-telling online mechanisms to online optimization.

[BibT_eX]

[DOI]

Baruch Awerbuch

Yossi Azar

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Representing Graph Metrics with Fewest Edges.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Online oblivious routing.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

2002

Approximation algorithms for network design problems.

[BibT_eX]

[DOI]

PhD thesis, 2002

Streaming-Data Algorithms for High-Quality Clustering.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2001

Profit-earning facility location.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Local search heuristic for k-median and facility location problems.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Web caching using access statistics.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Improved algorithms for fault tolerant facility location.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Distributed admission control, scheduling, and routing with stale information.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Using approximate majorization to characterize protocol fairness.

[BibT_eX]

[DOI]

Rishi Bhargava

Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 2001

Designing Networks Incrementally.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Online Facility Location.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

Hierarchical Placement and Network Design Problems.

[BibT_eX]

[DOI]