Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
Combinatorics is one of the fastest growing fields of mathematics. One reason for this is because many practical problems can be modeled and then efficiently solved using combinatorial theory. This real world motivation for studying algorithmic combinatorics has led not only to the development of many software packages but also to some beautiful mathematics which has no direct application to applied problems. This book highlights a few of the exciting recent developments in algorithmic combinatorics, including the search for patterns in DNA and protein sequences, the theory of semi-definite programming and its role in combinatorial optimization, and the algorithmic aspects of tree decompositions and it's applications to the theory of databases, code optimization, and bioinformatics.
Claudia Linhares-Sales is Assistant Professor of Computer Science at the Federal University of Cear, Brazil. Bruce Reed is Canada Research Chair in Graph Theory at the School of Computer Science of McGill Univeristy.
Content Level »Research
Keywords »Algorithmic Combinatorics - Algorithms in Graph Theory - Graph - Graph theory - Matching - Theory of Algorithms - algorithms
* The Matching Lattice: M.H. de Carvalho, C.L. Lucchesi, U.S.R. Murty * Discrete Mathematics and Radio Channel Assignment: C. McDiarmid * On the Coloration of Perfect Graphs: F. Maffray * Algorithmic Aspects of Tree Width: B.A.Reed * A Survey on Clique Graphs: J.L.Szwarcfiter * Semidefinite Programs and Combinatorial Optimization: L. Lovász * Approximability of NP-Optimization Problems: A.Steger * Pattern Inference Under Many Guises: M.F.Sagot, Y. Wakabayashi * Szemerédi's Regularity Lemma and Quasi-Randomness: Y. Kohayakawa, V. Rödl