{"product_id":"combinatorial-optimization-theory-and-algorithms-paperback","title":"Combinatorial Optimization: Theory and Algorithms - Paperback","description":"\u003cp\u003eby \u003cb\u003eBernhard Korte\u003c\/b\u003e (Author), \u003cb\u003eJens Vygen\u003c\/b\u003e (Author)\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eWell-written, popular textbook on combinatorial optimization \u003c\/p\u003e\u003cp\u003eOne of very few textbooks on this topic \u003c\/p\u003e\u003cp\u003eSubject area has manifold applications \u003c\/p\u003e\u003cp\u003eOffers complete but concise proofs, making it an invaluable practical tool for students \u003c\/p\u003e\u003cp\u003eUpdated fifth edition\u003c\/p\u003e\u003ch3\u003eBack Jacket\u003c\/h3\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eThis comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references.\u003c\/p\u003e\u003cp\u003eThis sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization. \u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eFrom the reviews of the previous editions: \u003c\/p\u003e\u003cp\u003e\"This book on combinatorial optimization is a beautiful example of the ideal textbook.\"\u003cbr\u003eOperations Research Letters 33 (2005)\u003c\/p\u003e\u003cp\u003e\"This is the 5th edition of one of the standard books in combinatorial optimization. It is an excellent book covering everything from the basics up to the most advanced topics (graduate level and current research). It provides theoretical results, underlying ideas, algorithms and the needed basics in graph theory in a very nice, comprehensive way. The book also provides insights into and pointers to adjacent areas that could not be covered in full length for the interested reader. \"Combinatorial Optimization\" can easily serve as an (almost) complete reference for current research and is state-of-the-art. [...]\"\u003cbr\u003eZentralblatt MATH 1237.90001\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003cp\u003e \u003c\/p\u003e\u003ch3\u003eAuthor Biography\u003c\/h3\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eBernhard Korte is professor of operations research and director of the Research Institute for Discrete Mathematics at the University of Bonn. He founded the Arithmeum in Bonn and received numerous awards, including a honorary doctoral degree and the \"Staatspreis NRW\". His research interests include combinatorial optimization and chip design.\u003c\/p\u003e \u003cp\u003eJens Vygen is professor of discrete mathematics at the University of Bonn and principal investigator of the Hausdorff Center for Mathematics. He also co-authored the textbook \"Algorithmic Mathematics\" and has served as editor of several books and journals. His research interests include combinatorial optimization and algorithms for chip design.\u003cbr\u003e\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 698\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 1.44 x 9.21 x 6.14 IN\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eIllustrated:\u003c\/strong\u003e Yes\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e January 11, 2019\u003c\/div\u003e","brand":"Books by splitShops","offers":[{"title":"Default Title","offer_id":42711331209279,"sku":"9783662585665","price":136.06,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0105\/8226\/1823\/files\/feb6b2d84c9200bf307fdef46bc413b1.webp?v=1765058124","url":"https:\/\/dhlswag.com\/products\/combinatorial-optimization-theory-and-algorithms-paperback","provider":"BBB","version":"1.0","type":"link"}