{"product_id":"steiner-tree-problems-in-computer-ding-zhu-du-9789812791443","title":"Steiner Tree Problems in Computer Communication Networks","description":"The Steiner tree problem is one of the most important combinatorial optimization problems. It has a long history that can be traced back to the famous mathematician Fermat (1601-1665). This book studies three significant breakthroughs on the Steiner tree problem that were achieved in the 1990s, and some important applications of Steiner tree problems in computer communication networks researched in the past fifteen years. It not only covers some of the most recent developments in Steiner tree problems, but also discusses various combinatorial optimization methods, thus providing a balance between theory and practice.\u003cbr\u003e\u003cbr\u003e\u003cb\u003eAuthor:\u003c\/b\u003e Ding-Zhu Du,Xiaodong Hu\u003cbr\u003e\u003cb\u003eISBN-10:\u003c\/b\u003e 9812791442\u003cbr\u003e\u003cb\u003eISBN-13:\u003c\/b\u003e 9789812791443\u003cbr\u003e\u003cb\u003ePublisher:\u003c\/b\u003e World Scientific Publishing Company\u003cbr\u003e\u003cb\u003eLanguage:\u003c\/b\u003e English\u003cbr\u003e\u003cb\u003ePublished:\u003c\/b\u003e 02\/01\/2008\u003cbr\u003e\u003cb\u003ePages:\u003c\/b\u003e 376\u003cbr\u003e\u003cb\u003eFormat:\u003c\/b\u003e Hardcover\u003cbr\u003e\u003cb\u003eWeight:\u003c\/b\u003e 1.47lbs\u003cbr\u003e\u003cb\u003eSize:\u003c\/b\u003e 9.27h x 6.03w x 1.03d\u003cbr\u003e\u003cbr\u003e\u003cb\u003eReview Citation(s): \u003c\/b\u003e\u003cbr\u003e\u003ci\u003eScitech Book News\u003c\/i\u003e 06\/01\/2008 pg. 167","brand":"Ding-Zhu Du","offers":[{"title":"Hardcover","offer_id":48448124780799,"sku":"9789812791443","price":145.0,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0662\/2982\/9887\/files\/img_9cd17a5f-9dbc-43e3-afb2-ad2e54120de6.jpg?v=1777237063","url":"https:\/\/www.whiterainbookhouse.com\/products\/steiner-tree-problems-in-computer-ding-zhu-du-9789812791443","provider":"WR Book House","version":"1.0","type":"link"}