Combinatorial Optimization

Theory and Algorithms

Nonfiction, Science & Nature, Mathematics, Combinatorics, Calculus
Cover of the book Combinatorial Optimization by Bernhard Korte, Jens Vygen, Springer Berlin Heidelberg
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Bernhard Korte, Jens Vygen ISBN: 9783662560396
Publisher: Springer Berlin Heidelberg Publication: March 13, 2018
Imprint: Springer Language: English
Author: Bernhard Korte, Jens Vygen
ISBN: 9783662560396
Publisher: Springer Berlin Heidelberg
Publication: March 13, 2018
Imprint: Springer
Language: English

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 specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references.

This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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 specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references.

This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization.

More books from Springer Berlin Heidelberg

Cover of the book Tscherne Unfallchirurgie by Bernhard Korte, Jens Vygen
Cover of the book Maßtheorie für Statistiker by Bernhard Korte, Jens Vygen
Cover of the book Reconstituting the Constitution by Bernhard Korte, Jens Vygen
Cover of the book Clustering High--Dimensional Data by Bernhard Korte, Jens Vygen
Cover of the book Cardiac Arrhythmias: The Management of Atrial Fibrillation by Bernhard Korte, Jens Vygen
Cover of the book Normal Testicular Descent and the Aetiology of Cryptorchidism by Bernhard Korte, Jens Vygen
Cover of the book Taste by Bernhard Korte, Jens Vygen
Cover of the book Algorithmic Game Theory by Bernhard Korte, Jens Vygen
Cover of the book ABC of Pediatric Surgical Imaging by Bernhard Korte, Jens Vygen
Cover of the book Quantitative Remote Sensing in Thermal Infrared by Bernhard Korte, Jens Vygen
Cover of the book Current Topics in Pathology by Bernhard Korte, Jens Vygen
Cover of the book Total Hip Replacement by Bernhard Korte, Jens Vygen
Cover of the book Computational Methods for Physicists by Bernhard Korte, Jens Vygen
Cover of the book User-Centred Engineering by Bernhard Korte, Jens Vygen
Cover of the book Statistik angewandt by Bernhard Korte, Jens Vygen
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy