Gegenstand dieses Lehrbuchs ist die Behandlung schwer lösbarer diskreter Optimierungsprobleme. Im ersten Teil werden schnelle Algorithmen vorgestellt, die solche Probleme näherungsweise lösen können. Der zweite Teil behandelt Komplexitätstheorie und Nichtapproximierbarkeit von Optimierungsproblemen. Das Lehrbuch enthält zudem zahlreiche Anwendungsbeispiele, Übungsaufgaben, Illustrationen und Abschnitte über Grundlagen wie etwa die Turingmaschine.

Show description

Read Online or Download Approximative Algorithmen und Nichtapproximierbarkeit (de Gruyter Lehrbuch) (German Edition) PDF

Best Graph Theory books

Fixed Point Theory and Graph Theory: Foundations and Integrative Approaches

Fastened element idea and Graph idea presents an intersection among the theories of fastened aspect theorems that provide the stipulations lower than which maps (single or multivalued) have suggestions and graph concept which makes use of mathematical buildings to demonstrate the connection among ordered pairs of items when it comes to their vertices and directed edges.

Random Geometric Graphs (Oxford Studies in Probability)

This monograph presents and explains the maths at the back of geometric graph thought, which stories the houses of a graph that involves nodes put in Euclidean area in order that edges may be extra to attach issues which are as regards to each other. for instance, a set of bushes scattered in a woodland and the sickness that's handed among them, a collection of nests of animals or birds on a quarter and the communique among them or conversation among communications stations or nerve cells.

Matroid Theory (Oxford Graduate Texts in Mathematics)

* what's the essence of the similarity among linearly self sustaining units of columns of a matrix and forests in a graph? * Why does the grasping set of rules produce a spanning tree of minimal weight in a attached graph? * will we attempt in polynomial time no matter if a matrix is completely unimodular? Matroid concept examines and solutions questions like those.

The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators

This booklet presents an exhilarating historical past of the invention of Ramsey idea, and comprises new study in addition to infrequent images of the mathematicians who constructed this conception, together with Paul Erdös, B. L. van der Waerden, and Henry Baudet.

Extra info for Approximative Algorithmen und Nichtapproximierbarkeit (de Gruyter Lehrbuch) (German Edition)

Show sample text content

Rated 4.31 of 5 – based on 36 votes