The greedy strategy, considered in the preceding chapter, constructs a solution to an optimization problem…

Suppose we have to encode a text that comprises symbols from some n-symbol alphabet by assigning…

In this section, we consider the single-source shortest-paths problem: for a given vertex called the source in a…

In the previous section, we considered the greedy algorithm that “grows” a mini-mum spanning tree…

The following problem arises naturally in many practical situations: given n points, connect them in the cheapest…

Let us revisit the change-making problem faced, at least subconsciously, by millions of cashiers all over the…

We start this section with designing a dynamic programming algorithm for the knapsack problem: given n items…

In this section, we look at two well-known algorithms: Warshall’s algorithm for computing the transitive…

A Greedy algorithm is an algorithmic paradigm that builds up a solution piece by piece, always choosing…

Here is another well-known problem in algorithmics. Given n items of known weights w1, w2, . . .…