Steiner Tree Problems in Computer Communication Networks

Steiner Tree Problems in Computer Communication Networks
Author :
Publisher : World Scientific
Total Pages : 373
Release :
ISBN-10 : 9789812791450
ISBN-13 : 9812791450
Rating : 4/5 (50 Downloads)

Book Synopsis Steiner Tree Problems in Computer Communication Networks by : Dingzhu Du

Download or read book Steiner Tree Problems in Computer Communication Networks written by Dingzhu Du and published by World Scientific. This book was released on 2008-01-01 with total page 373 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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. Sample Chapter(s). Chapter 1: Minimax Approach and Steiner Ratio (372 KB). 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. Readership: Researchers and graduate students of computer science and engineering as well as operations research.


Steiner Tree Problems in Computer Communication Networks Related Books

Steiner Tree Problems in Computer Communication Networks
Language: en
Pages: 373
Authors: Dingzhu Du
Categories: Mathematics
Type: BOOK - Published: 2008-01-01 - Publisher: World Scientific

DOWNLOAD EBOOK

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 mathemati
Steiner Tree Problems in Computer Communication Networks
Language: en
Pages: 373
Authors: Dingzhu Du
Categories: Computers
Type: BOOK - Published: 2008 - Publisher: World Scientific

DOWNLOAD EBOOK

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 mathemati
Computational Science and Its Applications - ICCSA 2011
Language: en
Pages: 746
Authors: Beniamino Murgante
Categories: Computers
Type: BOOK - Published: 2011-06-17 - Publisher: Springer

DOWNLOAD EBOOK

The five-volume set LNCS 6782 - 6786 constitutes the refereed proceedings of the International Conference on Computational Science and Its Applications, ICCSA 2
Encyclopedia of Algorithms
Language: en
Pages: 1200
Authors: Ming-Yang Kao
Categories: Computers
Type: BOOK - Published: 2008-08-06 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

One of Springer’s renowned Major Reference Works, this awesome achievement provides a comprehensive set of solutions to important algorithmic problems for stu
The Steiner Tree Problem
Language: en
Pages: 353
Authors: F.K. Hwang
Categories: Computers
Type: BOOK - Published: 1992-10-20 - Publisher: Elsevier

DOWNLOAD EBOOK

The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are req