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.
2012
2012
RNP-SA: Joint Relay Placement and Sub-Carrier Allocation in Wireless Communication Networks with Sustainable Energy
Green energy is emerging as a promising alternative energy source to power network devices in next-generation wireless networks… 
2011
2011
Joint optimization for downlink resource allocation in cognitive radio cellular networks
This paper takes into account the uncertainty of the primary users' locations and transmission power in designing an optimal… 
2010
2010
Cost-Efficient Topology Design Problem in Time-Evolving Delay-Tolerant Networks
In this paper, we study the cost efficient topology design (CETD) problem in a predictable delay tolerant networks (DTN) where… 
2010
2010
An Evolving-Construction Scheme for Fuzzy Systems
This paper proposes an evolving-construction scheme for fuzzy systems (ECSFS). ECSFS begins with a simple fuzzy system and… 
2007
2007
Fully Automated Web Services Discovery and Composition Through Concept Covering and Concept Abduction
We propose a framework and tractable algorithms for semantic-based automated Web service composition, fully compliant with… 
Highly Cited
2005
Highly Cited
2005
Distributed channel assignment protocols: a cross-layer approach [wireless ad hoc networks]
Despite being the subject of many years of research, distributed channel assignment remains a challenging problem. In this paper… 
Highly Cited
2004
Highly Cited
2004
MM-Cubing: computing Iceberg cubes by factorizing the lattice space
The data cube and iceberg cube computation problem has been studied by many researchers. There are three major approaches… 
Highly Cited
2004
Highly Cited
2004
PoBOC: An Overlapping Clustering Algorithm, Application to Rule-Based Classification and Textual Data
This paper presents the clustering algorithm PoBOC (Pole-Based Overlapping Clustering). It has two main characteristics: the… 
Highly Cited
1999
Highly Cited
1999
Instruction Scheduling for TriMedia
Instruction scheduling is a crucial phase in a compiler for very long instruction word (VLIW) processors. This paper describes… 
1999
1999
Randomization and super-heuristics in choosing sensor sets for target tracking applications
Surveillance systems tracking multiple targets often do not have the sensing or computational resources to apply all sensors to…