{"product_id":"combinatorial-optimization-algorithms-and-complexity-9780131524620","title":"Combinatorial Optimization: Algorithms and Complexity","description":"\u003cdiv class=\"book-description\"\u003e\n\u003cp\u003e\u003cstrong\u003eCombinatorial Optimization: Algorithms and Complexity\u003c\/strong\u003e by Papadimitriou, Christos H.. hardcover edition. ISBN: 9780131524620.\u003c\/p\u003e\n\u003cp\u003eClearly written graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. \"Mathematicians wishing a self-contained introduction need look no further.\" €” American Mathematical Monthly. 1982 edition.\u003c\/p\u003e\n\u003c\/div\u003e","brand":"Prentice Hall","offers":[{"title":"Default Title","offer_id":44976732143669,"sku":"ByrdShop_0131524623","price":186.8,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0627\/8139\/0901\/files\/9780131524620_74854a84-2523-4f0d-8839-e6e42f63f923.jpg?v=1778715886","url":"https:\/\/atxbooks.com\/products\/combinatorial-optimization-algorithms-and-complexity-9780131524620","provider":"ATX Books","version":"1.0","type":"link"}