Combinatorial Optimization: Networks and Matroids

Front Cover
Courier Corporation, 2001 - Mathematics - 374 pages
1 Review
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Selected pages

Contents

lntroduction
1
Mathematical Preliminaries
15
Shortest Paths
59
Network Flows
109
Bipartite Matching
182
Nonbipartite Matching
217
Matroids and the Greedy Algorithm
264
Matroid Intersections
300
The Matroid Parity Problem
356
Copyright

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information