ISBN is

9780030848667 / 0030848660

Combinatorial Optimization: Networks and Matroids

by

Publisher:Oxford University Press, USA

Edition:Hardcover

Language:English

Prices INCLUDE standard shipping to United States
Show prices without shipping
Change shipping destination/currency
Shipping prices may be approximate. Please verify cost before checkout.

About the 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.

Search under way...

Search complete.

Click on the price to find out more about a book.

New books: 1 - 25 of 26

   

Used books: 1 - 25 of 68