EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link: https://ebookbell.com/faq

We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.

For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Steiner Tree Problems In Computer Communication Networks Dingzhu Du

Name: Steiner Tree Problems In Computer Communication Networks Dingzhu Du
SKU: BELL-1005788
Price: 31.00 USD
Availability: InStock
Rating: 4.1 (100 reviews)

SKU: BELL-1005788

$ 31.00 ~~$ 45.00~~ (-31%)

4.1

100 reviews

Steiner Tree Problems In Computer Communication Networks Dingzhu Du instant download after payment.

Publisher: World Scientific

File Extension: PDF

File size: 2.22 MB

Pages: 373

Author: Dingzhu Du, Xiaodong Hu

ISBN: 9789812791443, 9789812791450, 9812791442, 9812791450

Language: English

Year: 2008

Product desciption

Steiner Tree Problems In Computer Communication Networks Dingzhu Du by Dingzhu Du, Xiaodong Hu 9789812791443, 9789812791450, 9812791442, 9812791450 instant download after payment.

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.

Contents: Minimax Approach and Steiner Ratio; k-Steiner Ratios and Better Approximation Algorithms; Geometric Partitions and Polynomial Time Approximation Schemes; Grade of Service Steiner Tree Problem; Steiner Tree Problem for Minimal Steiner Points; Bottleneck Steiner Tree Problem; Steiner k-Tree and k-Path Routing Problems; Steiner Tree Coloring Problem; Steiner Tree Scheduling Problem; Survivable Steiner Network Problem.