 | 2012 |
| 20 |  | K.-W. Hwang,
David Applegate,
Aaron Archer,
Vijay Gopalakrishnan,
Seungjoon Lee,
V. Misra,
K. K. Ramakrishnan,
Deborah F. Swayne:
Leveraging Video Viewing Patterns for Optimal Content Placement.
Networking (2) 2012: 44-58 |
| 2011 |
| 19 |  | Aaron Archer,
MohammadHossein Bateni,
MohammadTaghi Hajiaghayi,
Howard J. Karloff:
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP.
SIAM J. Comput. 40(2): 309-332 (2011) |
| 2010 |
| 18 |  | David Applegate,
Aaron Archer,
Vijay Gopalakrishnan,
Seungjoon Lee,
K. K. Ramakrishnan:
Optimal content placement for a large-scale VoD system.
CoNEXT 2010: 4 |
| 17 |  | Aaron Archer,
Anna Blasiak:
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls.
SODA 2010: 429-447 |
| 2009 |
| 16 |  | Aaron Archer,
MohammadHossein Bateni,
Mohammad Taghi Hajiaghayi,
Howard J. Karloff:
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP.
FOCS 2009: 427-436 |
| 2008 |
| 15 |  | Aaron Archer,
Robert Kleinberg:
Truthful germs are contagious: a local to global characterization of truthfulness.
ACM Conference on Electronic Commerce 2008: 21-30 |
| 14 |  | Aaron Archer,
Shankar Krishnan:
Importance Sampling via Load-Balanced Facility Location.
IPCO 2008: 316-330 |
| 13 |  | Aaron Archer,
Asaf Levin,
David P. Williamson:
A Faster, Better Approximation Algorithm for the Minimum Latency Problem.
SIAM J. Comput. 37(5): 1472-1498 (2008) |
| 12 |  | Aaron Archer,
Robert Kleinberg:
Characterizing truthful mechanisms with convex type spaces.
SIGecom Exchanges 7(3): (2008) |
| 2007 |
| 11 |  | Aaron Archer,
Éva Tardos:
Frugal path mechanisms.
ACM Transactions on Algorithms 3(1): (2007) |
| 2004 |
| 10 |  | Aaron Archer,
Jittat Fakcharoenphol,
Chris Harrelson,
Robert Krauthgamer,
Kunal Talwar,
Éva Tardos:
Approximate classification via earthmover metrics.
SODA 2004: 1079-1087 |
| 9 |  | Aaron Archer,
Joan Feigenbaum,
Arvind Krishnamurthy,
Rahul Sami,
Scott Shenker:
Approximation and collusion in multicast cost sharing.
Games and Economic Behavior 47(1): 36-71 (2004) |
| 2003 |
| 8 |  | Aaron Archer,
Ranjithkumar Rajagopalan,
David B. Shmoys:
Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties.
ESA 2003: 31-42 |
| 7 |  | Aaron Archer,
Christos H. Papadimitriou,
Kunal Talwar,
Éva Tardos:
An approximate truthful mechanism for combinatorial auctions with single parameter agents.
SODA 2003: 205-214 |
| 6 |  | Aaron Archer,
David P. Williamson:
Faster approximation algorithms for the minimum latency problem.
SODA 2003: 88-96 |
| 5 |  | Aaron Archer,
Christos H. Papadimitriou,
Kunal Talwar,
Éva Tardos:
An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents.
Internet Mathematics 1(2): 129-150 (2003) |
| 2002 |
| 4 |  | Aaron Archer,
Éva Tardos:
Frugal path mechanisms.
SODA 2002: 991-999 |
| 2001 |
| 3 |  | Aaron Archer,
Éva Tardos:
Truthful Mechanisms for One-Parameter Agents.
FOCS 2001: 482-491 |
| 2 |  | Aaron Archer:
Two O (log* k)-Approximation Algorithms for the Asymmetric k-Center Problem.
IPCO 2001: 1-14 |
| 2000 |
| 1 |  | Aaron Archer:
On the upper chromatic numbers of the reals.
Discrete Mathematics 214(1-3): 65-75 (2000) |