Greedy Approximation
Greedy Approximation is an approximation algorithm that belongs to the class of iterative heuristics and is characterized by making, at each step, the locally optimal choice with the intent of achieving a global near-optimal solution.
1.6K
Publications
142.7K
Citations
3.6K
Authors
1.1K
Institutions
Publications per year
2017–2026
383
Parents
1.6K
Greedy function approximation: A gradient boosting machine.
Jerome H. Friedman · The Annals of Statistics · 2001 · 29K citations · Full text
A threshold of ln <i>n</i> for approximating set cover
Uriel Feige · Journal of the ACM · 1998 · 3.1K citations · Full text
Routing of multipoint connections
Bernard M. Waxman · IEEE Journal on Selected Areas in Communications · 1988 · 2.9K citations
A Greedy Heuristic for the Set-Covering Problem
Vašek Chvátal · Mathematics of Operations Research · 1979 · 2.6K citations
1–5 of 1.6K
3.6K
20
h-index
14
h-index
12
h-index
11
h-index
11
h-index
1–5 of 3.6K
1.1K
Massachusetts Institute of Technology
Cambridge, United States
31 h-index
49 publications
7.5K citations
Stanford University
Stanford, United States
24 h-index
48 publications
36.6K citations
University of South Carolina
Columbia, United States
23 h-index
58 publications
5.8K citations
Carnegie Mellon University
Pittsburgh, United States
22 h-index
71 publications
5.1K citations
Google (United States)
Mountain View, United States
20 h-index
42 publications
2.4K citations

University of Waterloo
Waterloo, Canada
19 h-index
30 publications
2.8K citations
The University of Texas at Dallas
Richardson, United States
19 h-index
49 publications
2.3K citations
University of Illinois Urbana-Champaign
Urbana, United States
18 h-index
33 publications
2.4K citations
1–8 of 1.1K
Repository · 66 publications · 2.3K citations
22
h-index
21 publications · 946 citations
17
h-index
17 publications · 2.1K citations
15
h-index
Conference · 17 publications · 1.1K citations
14
h-index
15 publications · 5.3K citations
14
h-index
1–5