For the best experience, please enable Javascript
x
Warning - This version of Internet Explorer is out of date. It has known security flaws and may not display all features of this website correctly. Please consider updating this browser.

Combinatorial Optimization: Networks and Matroids

Combinatorial Optimization: Networks and Matroids

By: Eugene Lawler

  • Book
  • Reg. Price › $24.95
  • eBook
  • Sale Price › $19.96
  • Paperback + eBook
  • Reg. Price › $27.45
  • Share this book:
  • Share on Google+

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.

Reprint of the Holt, Rinehart and Winston, New York, 1975 edition.
AvailabilityUsually ships in 24 to 48 hours
ISBN 100486414531
ISBN 139780486414539
Author/EditorEugene Lawler
FormatBook
Page Count384
Dimensions5 3/8 x 8 1/2

You might also Like...

Product Review

Out of Stock Notification: