Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
Last edited by IdentifierBot
August 4, 2010 | History
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.
Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
Previews available in: English
Showing 4 featured editions. View all 4 editions?
Edition | Availability |
---|---|
1
Combinatorial optimization: networks and matroids
2001, Dover Publications
in English
0486414531 9780486414539
|
zzzz
Libraries near you:
WorldCat
|
2
Combinatorial optimization: networks and matroids
1976, Holt, Rinehart and Winston
in English
0030848660 9780030848667
|
zzzz
Libraries near you:
WorldCat
|
3
Combinatorial Optimization: Networks and Matroids
December 31, 1975, Oxford University Press, USA
in English
0030848660 9780030848667
|
aaaa
Libraries near you:
WorldCat
|
4
Combinatorial Optimization: Networks and Matroids
December 31, 1975, Oxford University Press, USA
Hardcover
in English
0030848660 9780030848667
|
zzzz
Libraries near you:
WorldCat
|
Book Details
ID Numbers
Community Reviews (0)
Feedback?History
- Created April 29, 2008
- 6 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
August 4, 2010 | Edited by IdentifierBot | added LibraryThing ID |
April 24, 2010 | Edited by Open Library Bot | Fixed duplicate goodreads IDs. |
April 16, 2010 | Edited by bgimpertBot | Added goodreads ID. |
April 14, 2010 | Edited by Open Library Bot | Linked existing covers to the edition. |
April 29, 2008 | Created by an anonymous user | Imported from amazon.com record |