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

1997 | Buch

Geometry of Cuts and Metrics

Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, combinatorial matrix theory, statistical …

1997 | Buch

The Mathematics of Paul Erdös II

In 1992, when Paul Erdos was awarded a Doctor Honoris Causa by Charles University in Prague, a small conference was held, bringing together a distin­ guished group of researchers with interests spanning a variety of fields related to Erdos' own …

1997 | Buch

The Mathematics of Paul Erdös I

In 1992, when Paul Erdos was awarded a Doctor Honoris Causa by Charles University in Prague, a small conference was held, bringing together a distin­ guished group of researchers with interests spanning a variety of fields related to Erdos' own …

1993 | Buch

Discrete Images, Objects, and Functions in Zn

1993 | Buch

New Trends in Discrete and Computational Geometry

Discrete and computational geometry are two fields which in recent years have benefitted from the interaction between mathematics and computer science. The results are applicable in areas such as motion planning, robotics, scene analysis, and …

1993 | Buch

Geometric Algorithms and Combinatorial Optimization

Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated.

1991 | Buch

Greedoids

1990 | Buch

Mathematics of Ramsey Theory

One of the important areas of contemporary combinatorics is Ramsey theory. Ramsey theory is basically the study of structure preserved under partitions. The general philosophy is reflected by its interdisciplinary character. The ideas of Ramsey …

1989 | Buch

Irregularities of Partitions

The problem of uniform distribution of sequences initiated by Hardy, Little­ wood and Weyl in the 1910's has now become an important part of number theory. This is also true, in relation to combinatorics, of what is called Ramsey­ theory, a theory …

1989 | Buch

Matroid Theory and its Applications in Electric Network Theory and in Statics

I. The topics of this book The concept of a matroid has been known for more than five decades. Whitney (1935) introduced it as a common generalization of graphs and matrices. In the last two decades, it has become clear how important the concept …

1988 | Buch

Geometric Algorithms and Combinatorial Optimization

Historically, there is a close connection between geometry and optImization. This is illustrated by methods like the gradient method and the simplex method, which are associated with clear geometric pictures. In combinatorial optimization …

1987 | Buch

The Simplex Method

A Probabilistic Analysis

For more than 35 years now, George B. Dantzig's Simplex-Method has been the most efficient mathematical tool for solving linear programming problems. It is proba­ bly that mathematical algorithm for which the most computation time on computers is …

1987 | Buch

Systems Analysis by Graphs and Matroids

Structural Solvability and Controllability

Recent technology involves large-scale physical or engineering systems consisting of thousands of interconnected elementary units. This monograph illustrates how engineering problems can be solved using the recent results of combinatorial …