The SCEAS System
Navigation Menu

Search the dblp DataBase


Aaron Archer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Aaron Archer, Ranjithkumar Rajagopalan, David B. Shmoys
    Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:31-42 [Conf]
  2. Aaron Archer, Éva Tardos
    Truthful Mechanisms for One-Parameter Agents. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:482-491 [Conf]
  3. Aaron Archer
    Two O (log* k)-Approximation Algorithms for the Asymmetric k-Center Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:1-14 [Conf]
  4. Aaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos
    Approximate classification via earthmover metrics. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1079-1087 [Conf]
  5. Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos
    An approximate truthful mechanism for combinatorial auctions with single parameter agents. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:205-214 [Conf]
  6. Aaron Archer, Éva Tardos
    Frugal path mechanisms. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:991-999 [Conf]
  7. Aaron Archer, David P. Williamson
    Faster approximation algorithms for the minimum latency problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:88-96 [Conf]
  8. Aaron Archer
    On the upper chromatic numbers of the reals. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:214, n:1-3, pp:65-75 [Journal]
  9. Aaron Archer, Éva Tardos
    Frugal path mechanisms. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]

  10. Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP. [Citation Graph (, )][DBLP]

  11. Importance Sampling via Load-Balanced Facility Location. [Citation Graph (, )][DBLP]

  12. Truthful germs are contagious: a local to global characterization of truthfulness. [Citation Graph (, )][DBLP]

  13. Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002