Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
greedy approximation
Description:
An algorithmic approach that builds an approximate solution through successive locally optimal choices in optimization and computer science.
Related topics:
Complex Network Analysis Techniques (13%),
Advanced Banach Space Theory (11%),
Complexity and Algorithms in Graphs (7%)
OpenAlex ID:
keywords/greedy-approximation
Maximizing the spread of influence through a social network
2003
·
David Kempe
, Jon Kleinberg
, et al.
·
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)
·
9,591
Influential Nodes in a Diffusion Model for Social Networks
2005
·
David Kempe
, Jon Kleinberg
, et al.
·
Lecture notes in computer science
·
1,178
CELF++: optimizing the greedy algorithm for influence maximization in social networks
2011
·
Amit Goyal
, Wei Lu
, et al.
·
International World Wide Web Conference (WWW)
·
1,135
Limiting the spread of misinformation in social networks
2011
·
Ceren Budak
, Divyakant Agrawal
, et al.
·
International World Wide Web Conference (WWW)
·
976
Learning to Order Things
1999
·
W. W. Cohen
, R. E. Schapire
, et al.
·
Journal of Artificial Intelligence Research
·
909
PDF
BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learning
2019
·
Kirsch, Andreas
, van Amersfoort, Joost
, et al.
·
arXiv (Cornell University)
·
815
PDF
Some remarks on greedy algorithms
1996
·
R. A. DeVore
, V. N. Temlyakov
·
Advances in Computational Mathematics
·
646
Topics in Banach Space Theory
2016
·
Fernando Albiac
, Nigel J. Kalton
·
Graduate texts in mathematics
·
538
A Simple Lemma on Greedy Approximation in Hilbert Space and Convergence Rates for Projection Pursuit Regression and Neural Network Training
1992
·
Lee K. Jones
·
The Annals of Statistics
·
534
PDF
Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model
2012
·
Xinran He
, Guojie Song
, et al.
·
SIAM International Conference on Data Mining
·
463
Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
1998
·
V.K. Goyal
, M. Vetterli
, et al.
·
IEEE Transactions on Information Theory
·
451
PDF
Greedy Approximation
2008
·
Vladimir Temlyakov
·
Cambridge University Press eBooks
·
448
A Study of Global Inference Algorithms in Multi-document Summarization
2007
·
Ryan McDonald
·
Springer eBooks
·
417
Sparse Greedy Gaussian Process Regression
2000
·
Alex Smola
, Peter L. Bartlett
·
ANU Open Research (Australian National University)
·
417
Construction of an efficient overlay multicast infrastructure for real-time applications
2003
·
S. Banerjee
, C. Kommareddy
, et al.
·
IEEE Conference on Computer Communications (INFOCOM)
·
389
Approximation and learning by greedy algorithms
2008
·
Andrew R. Barron
, Albert Cohen
, et al.
·
The Annals of Statistics
·
376
PDF
Distributed cosegmentation via submodular optimization on anisotropic diffusion
2011
·
Gunhee Kim
, Eric P. Xing
, et al.
·
IEEE/CVF International Conference on Computer Vision (ICCV)
·
296
PDF
Cooperative Data Scheduling in Hybrid Vehicular Ad Hoc Networks: VANET as a Software Defined Network
2015
·
Kai Liu
, Joseph K. Y. Ng
, et al.
·
IEEE/ACM Transactions on Networking
·
276
Time-Critical Influence Maximization in Social Networks with Time-Delayed Diffusion Process
2021
·
Wei Chen
, Wei Lu
, et al.
·
Proceedings of the AAAI Conference on Artificial Intelligence
·
264
Blocking links to minimize contamination spread in a social network
2009
·
Masahiro Kimura
, Kazumi Saito
, et al.
·
ACM Transactions on Knowledge Discovery from Data
·
238
The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
2011
·
Entao Liu
, Vladimir N. Temlyakov
·
IEEE Transactions on Information Theory
·
233
A greedy approximation for minimum connected dominating sets
2004
·
Lu Ruan
, Hongwei Du
, et al.
·
Theoretical Computer Science
·
230
Extracting influential nodes on a social network for information diffusion
2009
·
Masahiro Kimura
, Kazumi Saito
, et al.
·
Data Mining and Knowledge Discovery
·
213
Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets
1999
·
Sudipto Guha
, Samir Khuller
·
Information and Computation
·
202
Greedy Algorithm for General Biorthogonal Systems
2000
·
P. Wojtaszczyk
·
Journal of Approximation Theory
·
186
PDF
Show more works
View as search
Works count:
881
Citation count:
33,730
Year
Topic
Type