The Art of Computer Programming, Volume 4C

The Art of Computer Programming, Volume 4C: Combinatorial Algorithms, Part 3

This volume will continue the story of methods that make it possible to solve many types of large problems that were long thought to be well beyond the reach of feasible computation. The fascinating field of combinatorial algorithms features numerous instances where a single good idea can make a program run thousands of times faster.

According to present plans, Volume 4C will contain the following sections, which are currently being assembled about seven major subareas:

7.2.2.3 Constraint Satisfaction

[The above section was published in paperback as Volume 4, Fascicle 7.]

7.2.2.4 Hamiltonian paths and cycles

7.2.2.5 Cliques

7.2.2.6 Covers

[The above three sections are planned to appear together as Volume 4, Fascicle 8.]

7.2.2.7 Squares

7.2.2.8 A Potpourri of Puzzles

7.2.2.9 Estimating Backtrack Costs

[The above three sections are planned to appear together as Volume 4, Fascicle 9.]

As usual, the emphasis is on connections between theory and practice, with careful attention to the history of the subject, together with hundreds of worked exercises.