Algorithms and Combinatorics

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and …

Partition functions arise in combinatorics and related problems of statistical physics as they encode in a succinct way the combinatorial structure of complicated systems. The main focus of the book is on efficient ways to compute (approximate) …

This book explores fundamental aspects of geometric network optimisation with applications to a variety of real world problems. It presents, for the first time in the literature, a cohesive mathematical framework within which the properties of suc

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and sp

Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering m

This is the first book devoted to the systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is a typical example of a hard to define notion, the authors devised an unifying

A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique introduction to matroid theory, emphasizing motivations from matrix theory and applications to systems analysis.

T

The book offers the readers a collection of high quality papers in selected topics of Discrete Mathematics, to celebrate the 60th birthday of
Professor Jarik Nešetril. Leading experts have contributed survey and research
papers in the areas

Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograph provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and …

It was more than a surprise to us that the first edition of this book already went out of print about a year after its first appearance. We were flattered by the many positive and even enthusiastic comments and letters from colleagues and the gen­ …

The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which events rapidly move from almost certainly false …

Combinatorial optimization is one of the youngest and most active areas of discrete mathematics, and is probably its driving force today. It became a subject in its own right about 50 years ago. This book describes the most important ideas …

Discrepancy theory is also called the theory of irregularities of distribution. Here are some typical questions: What is the "most uniform" way of dis­ tributing n points in the unit square? How big is the "irregularity" necessarily present in any …

Also the present second edition of this book is an introduction to the theory of clas­ sification, enumeration, construction and generation of finite unlabeled structures in mathematics and sciences. Since the publication of the first edition in …

I was pleasantly surprised when I was asked by Springer-Verlag to prepare a second edition of this volume on Linear Optimization and Extensions, which - not exactly contrary to my personal expectations - has apparently been accepted reasonably …

You can start by putting the DO NOT DISTURB sign. Cay, in Desert Hearts (1985). The interplay between randomness and computation is one of the most fas­ cinating scientific phenomena uncovered in the last couple of decades. This interplay is at …

Leave nothing to chance. This cliche embodies the common belief that ran­ domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could …