𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combinatorial algorithms: generation, enumeration, and search

✍ Scribed by Donald L. Kreher, Douglas R. Stinson

Book ID
127424164
Publisher
CRC Press
Year
1999
Tongue
English
Weight
4 MB
Series
CRC Press series on discrete mathematics and its applications
Edition
1
Category
Library
City
Boca Raton, Fla
ISBN-13
9780849339882

No coin nor oath required. For personal study only.

✦ Synopsis

This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods, applied to various combinatorial structures, such as combinations, permutations, graphs, and designs. Many classical areas are covered as well as new research topics not included in most existing texts such as group algorithms, graph isomorphism, Hill climbing, and heuristic search algorithms.

✦ Subjects

Комбинаторика

📜 SIMILAR VOLUMES

Fast Search Algorithms for VQ Codebook G
Fast Search Algorithms for VQ Codebook Generation
✍ Jim Z.C. Lai; C.C. Lue 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 230 KB

In this paper, we propose two fast codebook generation algo-book. Some alternative methods are also available [14]. rithms by making use of the information in the iterative process. The pairwise Nearest Neighbor (PNN) algorithm is a new Comparing to the conventional full search method (the LBG alter

Combinatorial Approximation Algorithms f
Combinatorial Approximation Algorithms for Generalized Flow Problems
✍ Jeffrey D Oldham 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Generalized network flow problems generalize normal network flow problems by specifying a flow multiplier µ v w for each arc v w . For every unit of flow entering the arc, µ v w units of flow exit. We present a strongly polynomial algorithm for a single-source generalized shortest paths problem, usi