Combinatorial Optimization: Networks and Matroids

by Eugene Lawler

Overview

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.

Product Details

ISBN-13:	9780486414539
Publisher:	Dover Publications
Publication date:	11/10/2011
Series:	Dover Books on Mathematics Series
Edition description:	Reprint
Pages:	384
Product dimensions:	5.50(w) x 8.50(h) x (d)

Table of Contents

Preface
Chapter 1 INTRODUCTION
Chapter 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

Editorial Reviews

Reprints a work originally published by Holt, Rinehart and Winston (New York, 1976). Focusing on combinatorial optimization problems involving matroids, this text is suitable for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics. After introducing the basic mathematical principles involved, the book examines shortest paths, network flows, and bipartite matching. It then goes on to discuss non-bipartite matching, the greedy algorithm, matroid intersections, and the matroid parity problem. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Booknews