7 search results - page 2 / 2 » Approximating the asymmetric profitable tour |
ESA
2006
Springer
15 years 1 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
JCSS
2008
14 years 9 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...