Recent Advances in Algorithms and Combinatorics

ISBN-13: 9781468492682 / Angielski / Miękka / 2012 / 352 str.

Bruce A. Reed; Claudia L. Linhares-Sales; Bruce A. Reed

Opis

Excellent authors, such as Lovasz, one of the five best combinatorialists in the world; Thematic linking that makes it a coherent collection; Will appeal to a variety of communities, such as mathematics, computer science and operations research

Recenzje

From the reviews:

"Combinatorics is one of the fastest growing fields of mathematics. ... From the table of contents one can see the wide range of topics covered. The authors are acknowledged researchers of the presented fields and guarantee the high quality of the volume. If you want to be up-to-date in combinatorics you should have this volume close to your hands." (Péter Hajnal, Acta Scientarium Mathematicarum, Vol. 69, 2003)

"This edited volume contains nine carefully written chapters in the area of combinatorics. ... The book is very well written and can be read individually by research students. The volume is of definite interest for researchers in combinatorics, graph theory and theoretical computer science. This book is certainly value for money and I would highly recommend it as an essential purchase for a university library." (G. Gutin, Journal of the Operational Research Society, Vol. 55 (5), 2004)

Spis treści

* 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

Blurb

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.