Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

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… Expand
  • table 1
Highly Cited
2007
Highly Cited
2007
Over the last decade, many metaheuristics have been applied to the flowshop scheduling problem, ranging from Simulated Annealing… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Highly Cited
2006
Highly Cited
2006
A simultaneous sparse approximation problem requests a good approximation of several input signals at once using different linear… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2006
Highly Cited
2006
Complexity theory of circuits strongly suggests that deep architectures can be much more efficient (sometimes exponentially) than… Expand
  • figure 1
  • table 2
Highly Cited
2001
Highly Cited
2001
Function estimation/approximation is viewed from the perspective of numerical optimization in function space, rather than… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2000
Highly Cited
2000
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Highly Cited
2000
Highly Cited
2000
  • B. Karp
  • MobiCom
  • 2000
  • Corpus ID: 56619246
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1971
Highly Cited
1971
Linear-algebra rank is the solution to an especially tractable optimization problem. This tractability is viewed abstractly, and… Expand