Mathematical Analysis - General & Miscellaneous, Computer Mathematics, Computer Science & Combinatorics, Mathematical Programming & Operations Research
Available on Bookshop
Write a review
Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Log in to track your reading progress.
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.Editorials
Booknews
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)Book Details
Published
March 28, 2003
Publisher
Dover Publications Inc.
Pages
400
Format
Paperback
ISBN
9780486414539