{"product_id":"combinatorial-optimization-algorithms-and-complexity-dover-books-on-computer-science","title":"Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)","description":"\u003ch3 data-start=\"0\" data-end=\"20\"\u003e\u003cstrong data-start=\"4\" data-end=\"20\"\u003eBook Details\u003c\/strong\u003e\u003c\/h3\u003e\n\u003cul data-start=\"22\" data-end=\"300\"\u003e\n\u003cli data-start=\"22\" data-end=\"57\"\u003e\n\u003cp data-start=\"24\" data-end=\"57\"\u003e\u003cstrong data-start=\"24\" data-end=\"37\"\u003ePublisher\u003c\/strong\u003e: Dover Publications\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli data-start=\"58\" data-end=\"117\"\u003e\n\u003cp data-start=\"60\" data-end=\"117\"\u003e\u003cstrong data-start=\"60\" data-end=\"71\"\u003eAuthors\u003c\/strong\u003e: Christos H. Papadimitriou, Kenneth Steiglitz\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli data-start=\"118\" data-end=\"141\"\u003e\n\u003cp data-start=\"120\" data-end=\"141\"\u003e\u003cstrong data-start=\"120\" data-end=\"132\"\u003eLanguage\u003c\/strong\u003e: English\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli data-start=\"142\" data-end=\"168\"\u003e\n\u003cp data-start=\"144\" data-end=\"168\"\u003e\u003cstrong data-start=\"144\" data-end=\"155\"\u003eEdition\u003c\/strong\u003e: New Edition\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli data-start=\"169\" data-end=\"194\"\u003e\n\u003cp data-start=\"171\" data-end=\"194\"\u003e\u003cstrong data-start=\"171\" data-end=\"179\"\u003eISBN\u003c\/strong\u003e: 9780486402581\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli data-start=\"195\" data-end=\"211\"\u003e\n\u003cp data-start=\"197\" data-end=\"211\"\u003e\u003cstrong data-start=\"197\" data-end=\"206\"\u003ePages\u003c\/strong\u003e: 528\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli data-start=\"212\" data-end=\"234\"\u003e\n\u003cp data-start=\"214\" data-end=\"234\"\u003e\u003cstrong data-start=\"214\" data-end=\"223\"\u003eCover\u003c\/strong\u003e: Paperback\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli data-start=\"235\" data-end=\"259\"\u003e\n\u003cp data-start=\"237\" data-end=\"259\"\u003e\u003cstrong data-start=\"237\" data-end=\"247\"\u003eFormat\u003c\/strong\u003e: Unabridged\u003c\/p\u003e\n\u003c\/li\u003e\n\u003cli data-start=\"260\" data-end=\"300\"\u003e\n\u003cp data-start=\"262\" data-end=\"300\"\u003e\u003cstrong data-start=\"262\" data-end=\"276\"\u003eDimensions\u003c\/strong\u003e: 8.4 x 5.3 x 1.0 inches\u003c\/p\u003e\n\u003c\/li\u003e\n\u003c\/ul\u003e\n\u003chr data-start=\"302\" data-end=\"305\"\u003e\n\u003ch3 data-start=\"307\" data-end=\"329\"\u003e\u003cstrong data-start=\"311\" data-end=\"329\"\u003eAbout The Book\u003c\/strong\u003e\u003c\/h3\u003e\n\u003cp data-start=\"331\" data-end=\"737\"\u003e\u003cem data-start=\"331\" data-end=\"386\"\u003eCombinatorial Optimization: Algorithms and Complexity\u003c\/em\u003e by Christos H. Papadimitriou and Kenneth Steiglitz is a rigorous and comprehensive textbook that serves as an essential guide to the field of combinatorial optimization. Written in a clear and concise manner, the book is designed for graduate-level students with a solid background in computer science, electrical engineering, or operations research.\u003c\/p\u003e\n\u003cp data-start=\"739\" data-end=\"1212\"\u003eThis book delves into advanced topics such as the simplex method, the Soviet ellipsoid algorithm for linear programming, and network flow. It also explores efficient algorithms for network flow, spanning trees, matching, matroids, and the theory of NP-complete problems. Additionally, the authors discuss local search heuristics for NP-complete problems and approximation algorithms, providing readers with a thorough understanding of combinatorial optimization techniques.\u003c\/p\u003e\n\u003cp data-start=\"1214\" data-end=\"1662\"\u003eWhat sets this textbook apart is the wealth of thought-provoking problems that accompany each chapter. These problems encourage critical thinking and problem-solving skills, making the book an invaluable resource for students. The new edition of this text was hailed by \u003cem data-start=\"1484\" data-end=\"1515\"\u003eAmerican Mathematical Monthly\u003c\/em\u003e and continues to be an indispensable reference for those interested in the algorithms and complexities associated with combinatorial optimization.\u003c\/p\u003e","brand":"Dover","offers":[{"title":"Default Title","offer_id":49921204191536,"sku":"Sarat_9780486402581","price":1913.0,"currency_code":"INR","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0690\/9968\/4144\/files\/dover-book-default-title-combinatorial-optimization-algorithms-and-complexity-dover-books-on-computer-science-41235472122160.jpg?v=1775961059","url":"https:\/\/www.retailmaharaj.com\/bn\/products\/combinatorial-optimization-algorithms-and-complexity-dover-books-on-computer-science","provider":"Retail Maharaj","version":"1.0","type":"link"}