Eugene Lawler

Combinatorial Optimization

Notify me when the book’s added
To read this book, upload an EPUB or FB2 file to Bookmate. How do I upload a book?
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.
This book is currently unavailable
1,405 printed pages
Original publication
2012

Impressions

How did you like the book?

Sign in or Register
fb2epub
Drag & drop your files (not more than 5 at once)