Steiner Tree Problems In Computer Communication Networks - Couverture rigide

Du, Ding-zhu; Hu, Xiaodong

 
9789812791443: Steiner Tree Problems In Computer Communication Networks
Couverture rigide
ISBN 10 : 9812791442 ISBN 13 : 9789812791443
Editeur : World Scientific Publishing Co Pte Ltd, 2008

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
World Scientific Publishing Co Pte Ltd
Date d'édition
2008
Langue
anglais
ISBN 10 
9812791442
ISBN 13 
9789812791443
Reliure
Relié
Nombre de pages
376
Coordonnées du fabricant
non disponible
Personne responsable
non disponible