Combinatorial optimization : theory and algorithms
Author(s)
Bibliographic Information
Combinatorial optimization : theory and algorithms
（Algorithms and combinatorics, Vol. 21）
Springer-Verlag, c2012
5th ed
- : pbk
Available at / 24 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
KOR||12||2(5)200026122587
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and indexes
"Softcover reprint of the hardcover 3rd edition 2012"--T.p. verso of paperback edition
Paperback edition has the preface to the fifth edition
Description and Table of Contents
Description
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 fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.
Table of Contents
1 Introduction.- 2 Graphs.- 3 Linear Programming.- 4 Linear Programming Algorithms.- 5 Integer Programming.- 6 Spanning Trees and Arborescences.- 7 Shortest Paths.- 8 Network Flows.- 9 Minimum Cost Flows.- 10 Maximum Matchings.- 11 Weighted Matching.- 12 b-Matchings and T -Joins.- 13 Matroids.- 14 Generalizations of Matroids.- 15 NP-Completeness.- 16 Approximation Algorithms.- 17 The Knapsack Problem.- 18 Bin-Packing.- 19 Multicommodity Flows and Edge-Disjoint Paths.- 20 Network Design Problems.- 21 The Traveling Salesman Problem.- 22 Facility Location.- Indices.
by "Nielsen BookData"
