{"product_id":"combinatorial-optimization-eugene-s-lawler-9780486414539","title":"Combinatorial Optimization: Networks and Matroids","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.\u003cbr\u003e\u003cbr\u003e\u003cb\u003eAuthor:\u003c\/b\u003e Eugene S. Lawler, Mathematics\u003cbr\u003e\u003cb\u003eISBN-10:\u003c\/b\u003e 0486414531\u003cbr\u003e\u003cb\u003eISBN-13:\u003c\/b\u003e 9780486414539\u003cbr\u003e\u003cb\u003ePublisher:\u003c\/b\u003e Dover Publications\u003cbr\u003e\u003cb\u003eLanguage:\u003c\/b\u003e English\u003cbr\u003e\u003cb\u003ePublished:\u003c\/b\u003e 11\/10\/2011\u003cbr\u003e\u003cb\u003ePages:\u003c\/b\u003e 384\u003cbr\u003e\u003cb\u003eFormat:\u003c\/b\u003e Paperback\u003cbr\u003e\u003cb\u003eWeight:\u003c\/b\u003e 0.89lbs\u003cbr\u003e\u003cb\u003eSize:\u003c\/b\u003e 8.48h x 5.36w x 0.76d\u003cbr\u003e\u003cbr\u003e\u003cb\u003eReview Citation(s): \u003c\/b\u003e\u003cbr\u003e\u003ci\u003eScitech Book News\u003c\/i\u003e 09\/01\/2001 pg. 48","brand":"Eugene S. Lawler","offers":[{"title":"Paperback","offer_id":43994857931007,"sku":"9780486414539","price":24.95,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0662\/2982\/9887\/files\/img_29d47120-56c0-4fb9-8dda-0ae9ad1769eb.jpg?v=1683332579","url":"https:\/\/www.whiterainbookhouse.com\/products\/combinatorial-optimization-eugene-s-lawler-9780486414539","provider":"WR Book House","version":"1.0","type":"link"}