Combinatorial Optimization Networks and

Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.

Preface Chapter 1 INTRODUCTIONChapter 2 MATHEMATICAL PRELIMINARIES
Chapter 3 SHORTEST PATHS
Chapter 4 NETWORK FLOWS Chapter 5 BIPARTITE MATCHING
Chapter 6 NONBIPARTITE MATCHING Chapter 7 MATROIDS AND THE GREEDY ALGORITHM Chapter 8 MATROID INTERSECTIONS Chapter 9 THE MATROID PARITY PROBLEM
Author Index Subject Index

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

FREE SHIPPING

Rent More, Save More! Use code: BBRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

Combinatorial Optimization Networks and Matroids

Summary

Table of Contents

Supplemental Materials