Disjoint paths, hypergraphs
Author(s)
Bibliographic Information
Disjoint paths, hypergraphs
（Algorithms and combinatorics, 24. Combinatorial optimization : polyhedra and efficiency / Alexander Schrijver ; v. C）
Springer, c2003
Related Bibliography 2 items
-
-
Paths, flows, matchings
BA60771964
-
Paths, flows, matchings
Available at / 50 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
SCH||124||3-303001615
-
No Libraries matched.
- Remove all filters.
Note
"Chapters 70-83"
Includes bibliographical references and indexes
Description and Table of Contents
Description
An in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization. These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.
Table of Contents
Introduction.- Paths and Flows.- Bipartite Matching and Covering.- Nonbipartite Matching and Covering.- Matroids and Submodular Functions.- Trees, Branchings, and Connectors.- Cliques, Stable Sets and Colouring.- Multiflows and Disjoint Paths.- Hypergraphs.- Survey of Problems, Questions and Conjectures.- References.- Name Index.- Subject Index.
by "Nielsen BookData"
