{"title":"David P. Williamson","description":null,"products":[{"product_id":"network-flow-algorithms-cambridge-university-press-9781316636831-david-p-williamson","title":"Network Flow Algorithms","description":"\u003cp\u003eThis comprehensive text and reference for graduate students and professionals in theoretical computer science, operations research, and discrete math offers an up-to-date, unified view of efficient combinatorial algorithms for a wide variety of network flow problems, including recent work on computing electrical flows and their applications.\u003c\/p\u003e","brand":"David P. Williamson","offers":[{"title":"Default Title","offer_id":52234193437014,"sku":"9781316636831","price":46.07,"currency_code":"EUR","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0886\/3206\/6390\/files\/9781316636831.jpg?v=1767753205"},{"product_id":"network-flow-algorithms-cambridge-university-press-9781107185890-david-p-williamson","title":"Network Flow Algorithms","description":"\u003cp\u003eThis comprehensive text and reference for graduate students and professionals in theoretical computer science, operations research, and discrete math offers an up-to-date, unified view of efficient combinatorial algorithms for a wide variety of network flow problems, including recent work on computing electrical flows and their applications.\u003c\/p\u003e","brand":"David P. Williamson","offers":[{"title":"Default Title","offer_id":52234535534934,"sku":"9781107185890","price":105.49,"currency_code":"EUR","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0886\/3206\/6390\/files\/9781107185890.jpg?v=1767753831"},{"product_id":"design-of-approximation-algorithms-cambridge-university-press-9780521195270-david-p-williamson","title":"Design of Approximation Algorithms","description":"\u003cp\u003eExplore the intricate world of algorithms with \u003cstrong\u003eDesign of Approximation Algorithms\u003c\/strong\u003e by \u003cstrong\u003eDavid P. Williamson\u003c\/strong\u003e, published by \u003cstrong\u003eCambridge University Press\u003c\/strong\u003e in 2011. This comprehensive hardback edition spans \u003cstrong\u003e518 pages\u003c\/strong\u003e and is meticulously crafted for graduate courses on algorithms while also serving as a valuable reference for researchers delving into heuristic solutions for discrete optimization problems.\u003c\/p\u003e \n\n\u003cp\u003eThis insightful book delves into essential algorithmic techniques for designing approximation algorithms. Readers will gain a profound understanding of various methodologies, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Whether you're a student or a seasoned researcher, this book is an indispensable resource for enhancing your knowledge in approximation theory and mathematical optimization.\u003c\/p\u003e","brand":"David P. Williamson","offers":[{"title":"Default Title","offer_id":52247329505622,"sku":"9780521195270","price":73.96,"currency_code":"EUR","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0886\/3206\/6390\/files\/9780521195270.jpg?v=1767772642"}],"url":"https:\/\/www.laufgard.com\/collections\/david-p-williamson.oembed","provider":"Bookshop","version":"1.0","type":"link"}