1 publication

  • Published Subscription

    Greedy Algorithm

    Abstract: In mathematics and computer science, an algorithm is a self-contained step-by-step set of operations to be performed. Algorithms exist that perform calculation, data processing, and automated reasoning. A greedy algorithm is an algorithm that follows the problem solving heuristic of making the locally optimal choice at each stage[1] with the hope of finding a global optimum. In many problems, a greedy strategy does not in general produce an optimal solution, …

    Published in Research & Reviews: Discrete Mathematical Structures · Vol. 2, Issue 2, 2015 · pp. 10–14 Read article

Support