Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:advantage |
May not produce globally optimal solution
Often efficient Simple to implement |
| gptkbp:characteristic |
Does not reconsider previous choices
Makes locally optimal choice at each step |
| gptkbp:contrastsWith |
gptkb:Dynamic_Programming
Divide and Conquer Backtracking |
| gptkbp:example |
gptkb:Dijkstra's_Algorithm
gptkb:Kruskal's_Algorithm gptkb:Prim's_Algorithm gptkb:Fractional_Knapsack_Problem Huffman Coding |
| https://www.w3.org/2000/01/rdf-schema#label |
Greedy Algorithm
|
| gptkbp:relatedTo |
Approximation Algorithms
Local Search |
| gptkbp:usedFor |
Optimization Problems
Combinatorial Problems |
| gptkbp:usedIn |
gptkb:Mathematics
Computer Science |
| gptkbp:bfsParent |
gptkb:Knapsack_Problem
gptkb:Set_Covering gptkb:Vertex_Cover gptkb:Cutting_Stock_Problem gptkb:Facility_Location gptkb:Set_Covering_Problem gptkb:Online_Load_Balancing |
| gptkbp:bfsLayer |
7
|