725 search results - page 2 / 145 » A General Greedy Approximation Algorithm with Applications |
SODA
2008
ACM
13 years 6 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
IPL
2008
13 years 4 months ago
2008
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in w...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We study dense instances of MaxCut and its generalizations. Following a long list of existing, diverse and often sophisticated approximation schemes, we propose taking the na
ESA
2006
Springer
13 years 8 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...
JAT
2006
13 years 4 months ago
2006
Opposed to linear schemes, nonlinear function approximation allows to obtain a dimension independent rate of convergence. Unfortunately, in the presence of data noise typical algo...