This complete textbook on combinatorial optimization locations special emphasis on theoretical effects and algorithms with provably good performance, unlike heuristics. it truly is in response to quite a few classes on combinatorial optimization and really good subject matters, quite often at graduate point. This publication studies the basics, covers the classical issues (paths, flows, matching, matroids, NP-completeness, approximation algorithms) intimately, and proceeds to complex and up to date issues, a few of that have now not seemed in a textbook earlier than. Throughout, it comprises whole yet concise proofs, and likewise offers numerous exercises and references. This 5th version has back been up to date, revised, and significantly extended, with greater than 60 new routines and new fabric on various topics, together with Cayley's formulation, blocking off flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest lower. therefore, this publication represents the state-of-the-art of combinatorial optimization.

Similar Combinatorics books

Difference Equations, Second Edition: An Introduction with Applications

Distinction Equations, moment version, offers a pragmatic creation to this significant box of suggestions for engineering and the actual sciences. subject assurance contains numerical research, numerical equipment, differential equations, combinatorics and discrete modeling. an indicator of this revision is the varied program to many subfields of arithmetic.

Finite Projective Spaces of Three Dimensions (Oxford Mathematical Monographs)

This self-contained and hugely targeted research considers projective areas of 3 dimensions over a finite box. it's the moment and middle quantity of a three-volume treatise on finite projective areas, the 1st quantity being Projective Geometrics Over Finite Fields (OUP, 1979). the current paintings restricts itself to 3 dimensions, and considers either subject matters that are analogous of geometry over the complicated numbers and issues that come up out of the fashionable concept of prevalence buildings.

Mathematical Problems and Proofs: Combinatorics, Number Theory, and Geometry

A steady advent to the hugely refined international of discrete arithmetic, Mathematical difficulties and Proofs offers issues starting from trouble-free definitions and theorems to complex themes -- reminiscent of cardinal numbers, producing features, homes of Fibonacci numbers, and Euclidean set of rules.

Intuitive Combinatorial Topology (Universitext)

Topology is a comparatively younger and intensely very important department of arithmetic, which reviews the houses of gadgets which are preserved via deformations, twistings, and stretchings. This ebook offers with the topology of curves and surfaces in addition to with the basic options of homotopy and homology, and does this in a full of life and well-motivated approach.

Additional info for Combinatorial Optimization (Algorithms and Combinatorics)

Show sample text content

Rated 4.97 of 5 – based on 13 votes