We’ve seen a slew of techniques that manipulate complete solutions. Let’s now consider some of the algorithms that work with partial or incomplete solutions and solve problems by constructing solutions one piece at a time. We begin with the best-known category: greedy algorithms.
KeywordsShort Path Search Space Dynamic Programming Greedy Algorithm Greedy Approach
Unable to display preview. Download preview PDF.