Sciweavers

ESA
2006
Springer
103views Algorithms» more  ESA 2006»
14 years 4 months ago
Greedy in Approximation Algorithms
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...
Julián Mestre