Combinatorial Search

by Martin Aigner

Introduces the basic ideas and most interesting instances of search problems. The first chapter discusses combinatorial search. Following chapters, which are relatively independent of one another, present five general types of search problems. Each subsection is accompanied by exercises, some of which are answered at the back of the book. Stresses connections with information theory, combinatorics, tree structures, order, and graphs.

Genres: Mathematics

Hardcover

First published September 17, 1979

Reviews

[Richard Marney · Rating 3 out of 5]

Selected chapters only. For the topics, a competent exposition.