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

Related topics

Related topics

50 relations
Algorithm designAntimatroidBest-first searchBrown clustering
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
A Review of Sparse Recovery Algorithms
Nowadays, a large amount of information has to be transmitted or processed. This implies high-power processing, large memory… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Review
2018
Review
2018
Last Meter Indoor Terahertz Wireless Access: Performance Insights and Implementation Roadmap
The terahertz band, 0.1-10 THz, has sufficient resources not only to satisfy the 5G requirements of 10 Gb/s peak data rate but to… Expand
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Review
2017
Review
2017
Age of Information: A New Concept, Metric, and Tool
In an increasingly networked world in which information is becoming increasingly actual, how can a system know with certainty… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 3.1
  • figure 3.2
Is this relevant?
Highly Cited
2007
Highly Cited
2007
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
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
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Greedy Layer-Wise Training of Deep Networks
Complexity theory of circuits strongly suggests that deep architectures can be much more efficient (sometimes exponentially) than… Expand
  • figure 1
  • table 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit
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
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Greedy function approximation: A gradient boosting machine.
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
Is this relevant?
Highly Cited
2000
Highly Cited
2000
GPSR: greedy perimeter stateless routing for wireless networks
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
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Adaptive greedy approximations
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
Is this relevant?
Highly Cited
1971
Highly Cited
1971
Matroids and the greedy algorithm
Linear-algebra rank is the solution to an especially tractable optimization problem. This tractability is viewed abstractly, and… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE