Greedy algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Greedy algorithm" in English language version.

Last modified: 13:41:10, 21 September 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

44doi.org

2^nd place

22arxiv.org

49^th place

31^st place

22worldcat.org

4^th place

11weizmann.ac.il

6,932^nd place

9,400^th place

11wisc.edu

891^st place

533^rd place

11kth.se

low place

11springer.com

182^nd place

172^nd place

11illinois.edu

1,178^th place

745^th place

11hal.science

2,005^th place

1,689^th place

11sciencedirect.com

137^th place

146^th place

11seas.harvard.edu

low place

11tue.nl

9,533^rd place

6,917^th place

11ghostarchive.org

64^th place

28^th place

arxiv.org (Global: 49^th place; English: 31^st place)

Yuster, Raphael (January 2021). "Paths with many shortcuts in tournaments". Discrete Mathematics. 344 (1) 112168. arXiv:2009.13985. doi:10.1016/j.disc.2020.112168.
Gupta, Shreya; Huang, Boyang; Impagliazzo, Russell (2024-11-27), The Greedy Coin Change Problem, arXiv:2411.18137

doi.org (Global: 2^nd place; English: 2^nd place)

Yuster, Raphael (January 2021). "Paths with many shortcuts in tournaments". Discrete Mathematics. 344 (1) 112168. arXiv:2009.13985. doi:10.1016/j.disc.2020.112168.
Edmonds, Jack (December 1971). "Matroids and the greedy algorithm". Mathematical Programming. 1 (1): 127–136. doi:10.1007/BF01584082. ISSN 0025-5610.
Brecklinghaus, Judith; Hougardy, Stefan (2015-05-01). "The approximation ratio of the greedy algorithm for the metric traveling salesman problem". Operations Research Letters. 43 (3): 259–261. doi:10.1016/j.orl.2015.02.009. ISSN 0167-6377.
Grimsman, David; Hespanha, Joao P.; Marden, Jason R. (December 17–19, 2018). Strategic Information Sharing in Greedy Submodular Maximization. IEEE Conference on Decision and Control. Miami, Fla.: IEEE. pp. 2722–2727. doi:10.1109/CDC.2018.8619166. ISBN 978-1-5386-1395-5.

ghostarchive.org (Global: 64^th place; English: 28^th place)

"Lecture 5: Introduction to Approximation Algorithms" (PDF). Advanced Algorithms (2IL45) — Course Notes. TU Eindhoven. Archived (PDF) from the original on 2022-10-09.

hal.science (Global: 2,005^th place; English: 1,689^th place)

inria.hal.science

Campos, Victor; Gyárfás, András; Havet, Frédéric; Linhares Sales, Claudia; Maffray, Frédéric (April 2010). New bounds on the Grundy number of products of graphs (Technical report). INRIA. RR-7243.

illinois.edu (Global: 1,178^th place; English: 745^th place)

jeffe.cs.illinois.edu

Erickson, Jeff (2019). "Greedy Algorithms". Algorithms. University of Illinois at Urbana-Champaign.

kth.se (Global: low place; English: low place)

"Lecture 1 – Basics and Greedy Algorithms" (PDF). KTH Social. KTH Royal Institute of Technology. Retrieved 30 April 2026.

sciencedirect.com (Global: 137^th place; English: 146^th place)

Brecklinghaus, Judith; Hougardy, Stefan (2015-05-01). "The approximation ratio of the greedy algorithm for the metric traveling salesman problem". Operations Research Letters. 43 (3): 259–261. doi:10.1016/j.orl.2015.02.009. ISSN 0167-6377.

seas.harvard.edu (Global: low place; English: low place)

people.seas.harvard.edu

Nelson, Jelani (March 7, 2017). "Lecture 13: PTAS/FPTAS/FPRAS examples; Approximation algorithms via SDP" (PDF). CS 224: Advanced Algorithms, Spring 2017. Scribe: Hongyao Ma. Harvard University. Retrieved May 1, 2026.

springer.com (Global: 182^nd place; English: 172^nd place)

link.springer.com

Edmonds, Jack (December 1971). "Matroids and the greedy algorithm". Mathematical Programming. 1 (1): 127–136. doi:10.1007/BF01584082. ISSN 0025-5610.

tue.nl (Global: 9,533^rd place; English: 6,917^th place)

win.tue.nl

"Lecture 5: Introduction to Approximation Algorithms" (PDF). Advanced Algorithms (2IL45) — Course Notes. TU Eindhoven. Archived (PDF) from the original on 2022-10-09.

weizmann.ac.il (Global: 6,932^nd place; English: 9,400^th place)

wisdom.weizmann.ac.il

Feige, Uriel. "Greedy algorithms and Matroids" (PDF). Department of Computer Science and Applied Mathematics, Weizmann Institute of Science. Retrieved 30 April 2026.

wisc.edu (Global: 891^st place; English: 533^rd place)

pages.cs.wisc.edu

van Melkebeek, Dieter. "Greedy Approximations" (PDF). University of Wisconsin–Madison. Retrieved 2025-07-25.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Edmonds, Jack (December 1971). "Matroids and the greedy algorithm". Mathematical Programming. 1 (1): 127–136. doi:10.1007/BF01584082. ISSN 0025-5610.
Brecklinghaus, Judith; Hougardy, Stefan (2015-05-01). "The approximation ratio of the greedy algorithm for the metric traveling salesman problem". Operations Research Letters. 43 (3): 259–261. doi:10.1016/j.orl.2015.02.009. ISSN 0167-6377.

Greedy algorithm (English Wikipedia)

arxiv.org (Global: 49th place; English: 31st place)

doi.org (Global: 2nd place; English: 2nd place)

ghostarchive.org (Global: 64th place; English: 28th place)

hal.science (Global: 2,005th place; English: 1,689th place)