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
2013
Highly Cited
2013
GeoSVR: A map-based stateless VANET routing
Highly Cited
2011
Highly Cited
2011
Efficient track linking methods for track graphs using network-flow and set-cover techniques
This paper proposes novel algorithms that use network-flow and set-cover techniques to perform occlusion reasoning for a large… 
Highly Cited
2008
Highly Cited
2008
Optimizing deployment of Internet gateway in Wireless Mesh Networks
Highly Cited
2004
Highly Cited
2004
Combination of hidden Markov models with dynamic time warping for speech recognition
We combine hidden Markov models of various topologies and nearest neighbor classification techniques in an exponential modeling… 
Highly Cited
2004
Highly Cited
2004
Organization-based cooperative coalition formation
The coalition formation problem has received a considerable amount of attention in recent years. In this work we present a novel… 
Highly Cited
2001
Highly Cited
2001
Data mining criteria for tree-based regression and classification
This paper is concerned with the construction of regression and classification trees that are more adapted to data mining… 
Highly Cited
1998
Highly Cited
1998
Adaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors
  • Jie Wu
  • IEEE Trans. Parallel Distributed Syst.
  • 1998
  • Corpus ID: 12941596
Reliable communication in cube-based multicomputers using the safety vector concept is studied in this paper. In our approach… 
Highly Cited
1995
Highly Cited
1995
Loading Multiple Pallets
This paper addresses the problem of loading pallets with non-identical items, i.e. what has been called the ‘Distributor's Pallet… 
Highly Cited
1994
Highly Cited
1994
Using a genetic algorithm to optimize problems with feasibility constraints
G.E. Liepins et al. (1990) have shown that genetic algorithm optimization of certain combinatorial optimization problems can be… 
Highly Cited
1994
Highly Cited
1994
An observation-based admission control algorithm for multimedia servers
Proposes a novel observation-based admission control algorithm, in which a client is admitted for service by a multimedia server… 
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)