{"product_id":"network-design-problems-in-graphs-and-on-the-plane-paperback","title":"Network-Design Problems in Graphs and on the Plane - Paperback","description":"\u003cdiv\u003e\u003cp style=\"text-align: right;\"\u003e\u003ca href=\"https:\/\/reportcopyrightinfringement.com\/\" target=\"_blank\" rel=\"nofollow\"\u003e\u003cb\u003eReport copyright infringement\u003c\/b\u003e\u003c\/a\u003e\u003c\/p\u003e\u003c\/div\u003e\u003cp\u003eby \u003cb\u003eKrzysztof Fleszar\u003c\/b\u003e (Author)\u003c\/p\u003e\u003cp\u003eGiven points in the plane, connect them using minimum ink. Though the task seems simple, it turns out to be very time consuming. In fact, scientists believe that computers cannot efficiently solve it. So, do we have to resign? This book examines such NP-hard network-design problems, from connectivity problems in graphs to polygonal drawing problems on the plane. First, we observe why it is so hard to optimally solve these problems. Then, we go over to attack them anyway. We develop fast algorithms that find approximate solutions that are very close to the optimal ones. Hence, connecting points with slightly more ink is not hard.\u003c\/p\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 218\u003c\/div\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 0.46 x 9.61 x 6.69 IN\u003c\/div\u003e\n            \u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e December 08, 2018\u003c\/div\u003e\n            ","brand":"Books by splitShops","offers":[{"title":"Default Title","offer_id":43157337964607,"sku":"9783958260764","price":73.72,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0105\/8226\/1823\/files\/aCoRLFYrtA9783958260764.webp?v=1776980291","url":"https:\/\/dhlswag.com\/products\/network-design-problems-in-graphs-and-on-the-plane-paperback","provider":"BBB","version":"1.0","type":"link"}