# The Leading eBooks Store Online

## for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry...

Most popular at the top

#### Combinatorics

Wiley 2003; US$ 186.00RUSSELL MERRIS, PhD , is Professor of Mathematics and Computer Science at California State University, Hayward. Among his other books is Graph Theory, also published by Wiley. more...

#### The Travelling Salesman Problem and Its Variations

Springer 2002; US$ 199.00This volume provides information on theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, and branch and bound, and branch and cut algorithms. more...

#### Surveys in Combinatorics 2003

Cambridge University Press 2003; US$ 104.00Survey papers from British Combinatorial Conference. Researchers and graduates will find much to inspire future work. more...

#### Recent Advances in Algoriths and Combinatorics {CMS Books in Mathematics ; 11}

Springer-Verlag New York Inc 2002; US$ 99.00This title consists of nine survey articles on various advances in algorithmic combinatorics. The articles cover both recent areas of application and exciting new theoretical developments. The book is accessible to Ph.D. students in discrete mathematics or theoretical computer science and is intended for researchers in the field of combinatorics. more...

#### Combinatorial Methods in Discrete Distributions

Wiley 2005; US$ 164.00A unique approach illustrating discrete distribution theory through combinatorial methods This book provides a unique approach by presenting combinatorial methods in tandem with discrete distribution theory. This method, particular to discreteness, allows readers to gain a deeper understanding of theory by using applications to solve problems. The... more...

#### Branch-and-Bound Applications in Combinatorial Data Analysis

Springer-Verlag New York Inc 2006; US$ 149.00This book provides explanatory text, illustrative mathematics and algorithms, demonstrations of the iterative process, pseudocode, and well-developed examples for (familiar as well as novel) applications of the branch-and-bound paradigm to relevant problems in combinatorial data analysis. more...

#### Theory of Association Schemes

Springer-Verlag Berlin and Heidelberg GmbH & Co. KG 2005; US$ 129.00Presents treatment of the structure theory of association schemes. This book presents generalization of Sylow's group theoretic theorems to scheme theory and also the algebraic proof of Tits' theorem on buildings of spherical type. It also includes characterization of Glauberman's, Z-involutions and is aimed at advanced undergraduate students. more...

#### Einführung in die Kombinatorik

De Gruyter 2003; US$ 49.00Ziel des Buches ist eine elementare Einführung in ausgewählte Teile der Kombinatorik. Dabei werden zusätzlich zur Darstellung der Grundlagen in jedem Kapitel exemplarisch einige tiefer liegende Resultate vollständig bewiesen. Das Buch will dem interessierten Nichtspezialisten den Reiz der Kombinatorik nahe bringen, ohne eine systematische... more...

#### The Probabilistic Method

Wiley 2011; US$ 153.00Praise for the Second Edition : "Serious researchers in combinatorics or algorithm design will wish to read the book in its entirety...the book may also be enjoyed on a lighter level since the different chapters are largely independent and so it is possible to pick out gems in one's own area..." ? Formal Aspects of Computing This Third Edition... more...

#### Matching Theory

Elsevier Science 1986; US$ 72.95This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic... more...