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
A location-aided routing protocol for cognitive radio networks
Multi-hop cognitive radio networks (CRNs) are gaining interest recently in many practical applications. With location information… 
Highly Cited
2009
Highly Cited
2009
Analysis of per-node traffic load in multi-hop wireless sensor networks
The energy expended by sensor nodes in data communication makes up a significant quantum of their total energy consumption… 
2009
2009
Scheduling in Flowshops with No-Idle Machines
This chapter deals with an interesting and not so well studied variant of the classical permutation flowshop problem with… 
Highly Cited
2007
Highly Cited
2007
Multiuser MIMO Downlink Made Practical: Achievable Rates with Simple Channel State Estimation and Feedback Schemes
We consider a MIMO fading broadcast channel and compute achievable ergodic rates when channel state information is acquired at… 
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
2003
Highly Cited
2003
An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
The prediction of a protein's structure from its amino-acid sequence is one of the most important problems in computational… 
Highly Cited
2002
Highly Cited
2002
A note on the minimum label spanning tree
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
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)