Greedy Algorithms
Greedy Algorithms is a class of algorithmic design strategies that constructs a solution by making a sequence of locally optimal choices at each step, hoping to achieve a globally optimal solution, distinguishing it from other algorithmic paradigms that may delay or reconsider decisions.
1.7K
Publications
110.6K
Citations
3.3K
Authors
1.1K
Institutions
Publications per year
2017–2026
468
1.7K
A threshold of ln <i>n</i> for approximating set cover
Uriel Feige · Journal of the ACM · 1998 · 3.1K citations · Full text
Greedy Randomized Adaptive Search Procedures
Thomas A. Feo, Maurício G. C. Resende · Journal of Global Optimization · 1995 · 2.7K citations
A Greedy Heuristic for the Set-Covering Problem
Vašek Chvátal · Mathematics of Operations Research · 1979 · 2.6K citations
Efficient influence maximization in social networks
Wei Chen, Yajun Wang, Siyu Yang · 2009 · 2.2K citations
1–5 of 1.7K
3.3K
19
h-index
19
h-index
15
h-index
14
h-index
12
h-index
1–5 of 3.3K
1.1K
Massachusetts Institute of Technology
Cambridge, United States
29 h-index
47 publications
4.2K citations

Huazhong University of Science and Technology
Wuhan, China
25 h-index
54 publications
3.3K citations
Carnegie Mellon University
Pittsburgh, United States
24 h-index
76 publications
3.6K citations
Liaocheng University
Liaocheng, China
23 h-index
71 publications
4.4K citations
Stanford University
Stanford, United States
23 h-index
48 publications
4.2K citations
Google (United States)
Mountain View, United States
22 h-index
55 publications
3.6K citations
University of South Carolina
Columbia, United States
21 h-index
53 publications
4.5K citations

Shanghai University
Shanghai, China
21 h-index
50 publications
3K citations
1–8 of 1.1K
Repository · 86 publications · 4.3K citations
30
h-index
27 publications · 1.3K citations
20
h-index
Conference · 28 publications · 1.6K citations
18
h-index
21 publications · 2.9K citations
18
h-index
20 publications · 1.2K citations
18
h-index
1–5