Skip to main content
main-content

Algorithms and Combinatorics

Algorithms and Combinatorics

Study and Research Texts

33 Jahrgänge | 1987 - 2018

Beschreibung

Combinatorial mathematics has substantially influenced recent trends and developments in the theory of algorithms and its applications. Conversely, research on algorithms and their complexity has established new perspectives in discrete mathematics. This series is devoted to the mathematics of these rapidly growing fields with special emphasis on their mutual interaction. The series covers areas in pure and applied mathematics as well as computer science, including: combinatorial and discrete optimization, polyhedral combinatorics, graph theory and its algorithmic aspects, network flows, matroids and their applications, algorithms in number theory, group theory etc., coding theory, algorithmic complexity of combinatorial problems, and combinatorial methods in computer science and related areas. Prospective readers of the series include scientists and graduate students interested in discrete mathematics, operations research, computer science and their applications.

Alle Bücher der Reihe Algorithms and Combinatorics

2018 | Buch

Combinatorial Optimization

Theory and Algorithms

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 …

2016 | Buch

Combinatorics and Complexity of Partition Functions

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) …

2015 | Buch

Optimal Interconnection Trees in the Plane

Theory, Algorithms and Applications

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

2012 | Buch

Combinatorial Optimization

Theory and Algorithms

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

2012 | Buch

Boolean Function Complexity

Advances and Frontiers

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

2012 | Buch

Sparsity

Graphs, Structures, and Algorithms

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

2010 | Buch

Matrices and Matroids for Systems Analysis

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

2008 | Buch

Combinatorial Optimization

Theory and Algorithms

2006 | Buch

Combinatorial Optimization

Theory and Algorithms

2006 | Buch

Topics in Discrete Mathematics

Dedicated to Jarik Nešetřil on the Occasion of his 60th Birthday

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

2003 | Buch

Discrete and Computational Geometry

The Goodman-Pollack Festschrift

2002 | Buch

Graph Colouring and the Probabilistic Method

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 …

2002 | Buch

Combinatorial Optimization

Theory and Algorithms

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­ …

2001 | Buch

The Strange Logic of Random Graphs

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 …

2000 | Buch

Combinatorial Optimization

Theory and Algorithms

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 …

1999 | Buch

Geometric Discrepancy

An Illustrated Guide

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 …

1999 | Buch

Applied Finite Group Actions

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 …

1999 | Buch

Linear Optimization and Extensions

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 …

1999 | Buch

Modern Cryptography, Probabilistic Proofs and Pseudorandomness

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 …

1998 | Buch

Probabilistic Methods for Algorithmic Discrete Mathematics

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 …