Subject
General Computer Science,Theoretical Computer Science
Reference50 articles.
1. An approximate truthful mechanism for combinatorial auctions with single parameter agents;Archer,2003
2. Truthful mechanisms for one-parameter agents;Archer,2001
3. Frugal path mechanisms;Archer,2002
4. One for the price of two: a unified approach for approximating covering problems;Bar-Yehuda;Algorithmica,2000
5. Improved approximations for the Steiner tree problem;Berman;J. Algorithms,1994
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献