Combinatorial Optimization: Networks and Matroids Contributor(s): Lawler, Eugene S. (Author), Mathematics (Author) |
|||||||
ISBN: 0486414531 ISBN-13: 9780486414539 Publisher: Dover Publications
WE WILL NOT BE UNDERSOLD! Click here for our low price guarantee Binding Type: Paperback - See All Available Formats & Editions Published: November 2011 Annotation: 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. Click for more in this series: Dover Books on Mathematics |
Additional Information |
BISAC Categories: - Mathematics | Combinatorics - Mathematics | Game Theory |
Dewey: 519 |
LCCN: 00060242 |
Series: Dover Books on Mathematics |
Physical Information: 0.76" H x 5.36" W x 8.48" L (0.89 lbs) 384 pages |
Review Citations: Scitech Book News 09/01/2001 pg. 48 |
Descriptions, Reviews, Etc. |
Publisher Description: 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. |
Customer ReviewsSubmit your own review |
To tell a friend about this book, you must Sign In First! |