KAUST DepartmentApplied Mathematics and Computational Science Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Permanent link to this recordhttp://hdl.handle.net/10754/668522
MetadataShow full item record
AbstractGreedy algorithms seek to find optimal solutions by making locally optimal steps. They form a class of usually simple (simple from the point of view of both description and time complexity) algorithms which often return optimal solutions or have good enough accuracy. This article presents representative greedy algorithms returning optimal solutions, such as Dijkstra's, Prim's, Huffman's, and Kruskal's algorithms. In addition, matroids, greedy algorithms for NP-hard problems, the set cover problem as well as randomized greedy algorithms and greedy approaches for continuous models are also discussed.
CitationMoshkov, M. (n.d.). Greedy Algorithms. Wiley Encyclopedia of Electrical and Electronics Engineering, 1–11. doi:10.1002/047134608x.w8262
SponsorsThe work with this paper was supported by the King Abdullah University of Science and Technology (KAUST). The author would like to thank the anonymous reviewer for valuable comments.