Combinatorial optimization
networks and matroids
Our rough guess is there are 93,500 words in this book.
At a pace averaging 250 words per minute, this book will take 6 hours and 14 minutes to read. With a half hour per day, this will take 13 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Publication
1976 - Holt, Rinehart and Winston, New York, New York (State)
Language
English
Word Count
93,500 words, Guess
Page Count
374 pages
Identifiers
- Internet Archivecombinatorialopt00lawl
- Internet Archivecombinatorialopt00lawl_981
- ISBN-100030848660
- ISBN-139780030848667
- Goodreads3534239
and 4 more
- Library of Congress Control Number76013516
- OCLC Control Number2189076
- Better World Books9780030848667
- Open LibraryOL4883905M
Classifications
- DDC519.7
- LCCQA402.5 .L39
- LCCQA402.5
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.
Subjects
Other Editions
- Combinatorial optimization: networks and matroids
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!