Description: Please refer to the section BELOW (and NOT ABOVE) this line for the product details - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Title:Combinatorial Optimization: Networks And MatroidsISBN13:9780486414539ISBN10:0486414531Author:Lawler, Eugene S. (Author), Mathematics (Author)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 Binding:Paperback, PaperbackPublisher:DOVER PUBN INCPublication Date:2011-11-10Weight:0.89 lbsDimensions:0.76'' H x 8.48'' L x 5.36'' WNumber of Pages:384Language:English
Price: 19.3 USD
Location: USA
End Time: 2024-10-26T09:44:23.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
Return policy details:
Book Title: Combinatorial Optimization: Networks And Matroids
Item Length: 8.7in.
Item Height: 1in.
Item Width: 5in.
Author: Eugene Lawler
Publication Name: Combinatorial Optimization : Networks and Matroids
Format: Trade Paperback
Language: English
Publisher: Dover Publications, Incorporated
Series: Dover Books ON Mathematics Ser.
Publication Year: 2011
Type: Textbook
Item Weight: 13.6 Oz
Number of Pages: 374 Pages
