190
Chapter 4 Greedy Algorithms
Prove that, for a given set of boxes with specified weights, the greedy
algorithm currently in use actually minimizes the number of trucks that
are needed. Your proof should follow the type of analysis we used for
the Inter
240
Chapter 5 Divide and Conquer
polynomial P by its values on the (d 1)st roots of unity is sometimes referred
to as the discrete Fourier transform of P; and the heart of our procedure is a
method for making this computation fast.
A Recursive Procedure f
306
Solved Exercises
Chapter 6 Dynamic Programming
edge (x, first[x]) from the pointer graph, and not use x for future updates until
its distance value changes.
This can save a lot of future work in updates, but what is the effect on the
worst-case runnin
18
Chapter 1 Introduction: Some Representative Problems
Solved Exercises
Solved Exercises
Figure 1.7 An instance of the Competitive FaciBt3, Location Problem.
Solved Exercise 1
Consider a town with n men and n women seeking to get married to one
another.
182
Solved Exercises
Chapter 4 Greedy Algorithms
The arborescences of G are in one-to-one correspondence with arborescences
of G that have exactly one edge entering the cycle C; and these corresponding
arborescences have the same cost with respect to cfw_