Disjoint paths, hypergraphs
著者
書誌事項
Disjoint paths, hypergraphs
（Algorithms and combinatorics, 24. Combinatorial optimization : polyhedra and efficiency / Alexander Schrijver ; v. C）
Springer, c2003
並立書誌 全2件
-
-
Paths, flows, matchings
BA60771964
-
Paths, flows, matchings
大学図書館所蔵 件 / 全50件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
"Chapters 70-83"
Includes bibliographical references and indexes
内容説明・目次
内容説明
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.
目次
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.
「Nielsen BookData」 より
