Meanings
- computerThe property of being globally solvable optimally by making optimal decisions locally.
Developing efficient algorithms for computing shortest paths in a time varying spatial network is challenging because these journeys do not always display greedy property or optimal substructure, making techniques like dynamic programming inapplicable.
2012, Betsy George, Sangho Kim, Spatio-temporal Networks: Modeling and Algorithms (SpringerBriefs in Computer Science), Springer Science & Business Media, →ISBN, page 251 more example
It has the greedy property (difficult to prove in time-critical contest environment!). If we make a choice that seems like the best at the moment and proceed to solve the remaining subproblem, we reach the optimal solution. We will never have to reconsider our previous choices.
2013, Steven Halim, Felix Halim, Competitive Programming 3: The New Lower Bound of Programming Contests., page 89
Cite this entry
greedy property. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/greedy%20property
“greedy property.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/greedy%20property. Accessed November 4, 2026.
WatkinsX Dictionary, s.v. “greedy property,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/greedy%20property.
Source: greedy property on Wiktionary, CC BY-SA 4.0.