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)

Related topics

Related topics

50 relations
Algorithm designAntimatroidBest-first searchBrown clustering

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Feature selection based on mutual information
The application of machine learning models such as support vector machine (SVM) and artificial neural networks (ANN) in… 
Highly Cited
2010
Highly Cited
2010
Distributed Wireless Sensor Network Localization Via Sequential Greedy Optimization Algorithm
Node localization is essential to most applications of wireless sensor networks (WSNs). In this paper, we consider both range… 
Highly Cited
2009
Highly Cited
2009
Greedy sparse signal reconstruction from sign measurements
  • P. Boufounos
  • Conference Record of the Forty-Third Asilomar…
  • 2009
  • Corpus ID: 16718813
This paper presents Matched Sign Pursuit (MSP), a new greedy algorithm to perform sparse signal reconstruction from signs of… 
Highly Cited
2008
Highly Cited
2008
Ant colony optimization combined with taboo search for the job shop scheduling problem
Highly Cited
2005
Highly Cited
2005
Simultaneous sparse approximation via greedy pursuit
A simple sparse approximation problem requests an approximation of a given input signal as a linear combination of T elementary… 
Highly Cited
2003
Highly Cited
2003
Position-based multicast routing for mobile Ad-hoc networks
In this paper we present Position-Based Multicast (PBM), a multicast routing algorithm for mobile ad-hoc networks which does… 
Highly Cited
2002
Highly Cited
2002
A Greedy EM Algorithm for Gaussian Mixture Learning
Learning a Gaussian mixture with a local algorithm like EM can be difficult because (i) the true number of mixing components is… 
Highly Cited
2002
Highly Cited
2002
Solving container loading problems by block arrangement
Highly Cited
1987
Highly Cited
1987
An efficient real-time implementation of the Wigner-Ville distribution
The Wigner-Ville distribution (WVD) is a valuable tool for time-frequency signal analysis. In order to implement the WVD in real… 
Highly Cited
1983
Highly Cited
1983
A "Greedy" Channel Router
We present a new, "greedy", channel-router that is quick, simple, and highly effective. It always succeeds, usually using no more… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)