"greedy property" meaning in All languages combined

{
  "head_templates": [
    {
      "args": {
        "1": "?"
      },
      "expansion": "greedy property",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2013, Steven Halim, Felix Halim, Competitive Programming 3: The New Lower Bound of Programming Contests., page 89:",
          "text": "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.",
          "type": "quote"
        },
        {
          "ref": "2012, Betsy George, Sangho Kim, Spatio-temporal Networks: Modeling and Algorithms (SpringerBriefs in Computer Science), Springer Science & Business Media, →ISBN, page 25:",
          "text": "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.",
          "type": "quote"
        }
      ],
      "glosses": [
        "The property of being globally solvable optimally by making optimal decisions locally."
      ],
      "id": "en-greedy_property-en-noun-nm-f~uXi",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "property",
          "property"
        ],
        [
          "solvable",
          "solvable"
        ],
        [
          "optimal",
          "optimal"
        ],
        [
          "local",
          "local"
        ]
      ],
      "raw_glosses": [
        "(computer science) The property of being globally solvable optimally by making optimal decisions locally."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "greedy property"
}

{
  "head_templates": [
    {
      "args": {
        "1": "?"
      },
      "expansion": "greedy property",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English nouns with unknown or uncertain plurals",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computer science"
      ],
      "examples": [
        {
          "ref": "2013, Steven Halim, Felix Halim, Competitive Programming 3: The New Lower Bound of Programming Contests., page 89:",
          "text": "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.",
          "type": "quote"
        },
        {
          "ref": "2012, Betsy George, Sangho Kim, Spatio-temporal Networks: Modeling and Algorithms (SpringerBriefs in Computer Science), Springer Science & Business Media, →ISBN, page 25:",
          "text": "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.",
          "type": "quote"
        }
      ],
      "glosses": [
        "The property of being globally solvable optimally by making optimal decisions locally."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "property",
          "property"
        ],
        [
          "solvable",
          "solvable"
        ],
        [
          "optimal",
          "optimal"
        ],
        [
          "local",
          "local"
        ]
      ],
      "raw_glosses": [
        "(computer science) The property of being globally solvable optimally by making optimal decisions locally."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "greedy property"
}