Skip to search formSkip to main contentSkip to account menu

Greedy algorithm

Known as: Greedy method, Greedy algorithms, Greedy heuristic 
A greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the locally optimal choice at each stage with the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Kempe et al. [4] (KKT) showed the problem of influence maximization is NP-hard and a simple greedy algorithm guarantees the best… 
Highly Cited
2010
Highly Cited
2010
With the proliferation of mobile devices and wireless technologies, mobile social network systems are increasingly available. A… 
Highly Cited
2007
Highly Cited
2007
We present Epoch-Greedy, an algorithm for multi-armed bandits with observable side information. Epoch-Greedy has the following… 
Highly Cited
2006
Highly Cited
2006
Complexity theory of circuits strongly suggests that deep architectures can be much more efficient (sometimes exponentially) than… 
Highly Cited
2001
Highly Cited
2001
Function estimation/approximation is viewed from the perspective of numerical optimization in function space, rather than… 
Highly Cited
2000
Highly Cited
2000
  • B. KarpH. Kung
  • ACM/IEEE International Conference on Mobile…
  • 2000
  • Corpus ID: 216589351
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the… 
Highly Cited
1998
Highly Cited
1998
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to… 
Highly Cited
1997
Highly Cited
1997
The problem of optimally approximating a function with a linear expansion over a redundant dictionary of waveforms is NP-hard… 
Highly Cited
1996
Highly Cited
1996
Estimates are given for the rate of approximation of a function by means of greedy algorithms. The estimates apply to… 
Highly Cited
1971
Highly Cited
1971
  • J. Edmonds
  • Mathematical programming
  • 1971
  • Corpus ID: 5599224
Linear-algebra rank is the solution to an especially tractable optimization problem. This tractability is viewed abstractly, and…