Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 207,980,510 papers from all fields of science
Search
Sign In
Create Free Account
Greedy algorithm
Known as:
Greedy method
, Greedy algorithms
, Greedy heuristic
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Algorithm design
Antimatroid
Best-first search
Brown clustering
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
CELF++: optimizing the greedy algorithm for influence maximization in social networks
A. Goyal
,
Wei Lu
,
L. Lakshmanan
The Web Conference
2011
Corpus ID: 3460004
Kempe et al. [4] (KKT) showed the problem of influence maximization is NP-hard and a simple greedy algorithm guarantees the best…
Expand
Highly Cited
2010
Highly Cited
2010
Community-based greedy algorithm for mining top-K influential nodes in mobile social networks
Yu Wang
,
G. Cong
,
Guojie Song
,
Kunqing Xie
Knowledge Discovery and Data Mining
2010
Corpus ID: 207181276
With the proliferation of mobile devices and wireless technologies, mobile social network systems are increasingly available. A…
Expand
Highly Cited
2007
Highly Cited
2007
The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information
J. Langford
,
Tong Zhang
NIPS
2007
Corpus ID: 23376488
We present Epoch-Greedy, an algorithm for multi-armed bandits with observable side information. Epoch-Greedy has the following…
Expand
Highly Cited
2006
Highly Cited
2006
Greedy Layer-Wise Training of Deep Networks
Yoshua Bengio
,
Pascal Lamblin
,
D. Popovici
,
H. Larochelle
NIPS
2006
Corpus ID: 14201947
Complexity theory of circuits strongly suggests that deep architectures can be much more efficient (sometimes exponentially) than…
Expand
Highly Cited
2001
Highly Cited
2001
Greedy function approximation: A gradient boosting machine.
J. Friedman
2001
Corpus ID: 39450643
Function estimation/approximation is viewed from the perspective of numerical optimization in function space, rather than…
Expand
Highly Cited
2000
Highly Cited
2000
GPSR: greedy perimeter stateless routing for wireless networks
B. Karp
,
H. Kung
ACM/IEEE International Conference on Mobile…
2000
Corpus ID: 216589351
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the…
Expand
Highly Cited
1998
Highly Cited
1998
Greedy strikes back: improved facility location algorithms
S. Guha
,
S. Khuller
ACM-SIAM Symposium on Discrete Algorithms
1998
Corpus ID: 5363214
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to…
Expand
Highly Cited
1997
Highly Cited
1997
Adaptive greedy approximations
G. Davis
,
S. Mallat
,
M. Avellaneda
1997
Corpus ID: 121066701
The problem of optimally approximating a function with a linear expansion over a redundant dictionary of waveforms is NP-hard…
Expand
Highly Cited
1996
Highly Cited
1996
Some remarks on greedy algorithms
R. DeVore
,
V. Temlyakov
Advances in Computational Mathematics
1996
Corpus ID: 15510358
Estimates are given for the rate of approximation of a function by means of greedy algorithms. The estimates apply to…
Expand
Highly Cited
1971
Highly Cited
1971
Matroids and the greedy algorithm
J. Edmonds
Mathematical programming
1971
Corpus ID: 5599224
Linear-algebra rank is the solution to an especially tractable optimization problem. This tractability is viewed abstractly, and…
Expand
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)
ACCEPT & CONTINUE