Show simple item record

dc.contributor.authorMoshkov, Mikhail
dc.date.accessioned2021-04-04T13:54:06Z
dc.date.available2021-04-04T13:54:06Z
dc.date.issued2015-06-15
dc.identifier.citationMoshkov, M. (n.d.). Greedy Algorithms. Wiley Encyclopedia of Electrical and Electronics Engineering, 1–11. doi:10.1002/047134608x.w8262
dc.identifier.isbn9780471346081
dc.identifier.doi10.1002/047134608x.w8262
dc.identifier.urihttp://hdl.handle.net/10754/668522
dc.description.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.
dc.description.sponsorshipThe 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.
dc.publisherWiley
dc.relation.urlhttps://onlinelibrary.wiley.com/doi/full/10.1002/047134608X.W8262
dc.rightsArchived with thanks to John Wiley & Sons, Inc.
dc.titleGreedy Algorithms
dc.typeBook Chapter
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
dc.eprint.versionPost-print
dc.identifier.pages1-11
kaust.personMoshkov, Mikhail


This item appears in the following Collection(s)

Show simple item record