Steiner Tree Problems In Computer Communication Networks

Ding-Zhu Du, Xiaodong Hu (Autoren)

Buch | Hardcover

376 Seiten

2008
World Scientific Publishing Co Pte Ltd (Verlag)
9789812791443 (ISBN)

Titel z.Zt. nicht lieferbar
Versandkostenfrei
Auch auf Rechnung

Artikel merken

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 (1601A-1665). This book studies some of the applications of Steiner tree problems in computer communication networks, which have been discovered and studied extensively.

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.

Fundamentals of Classical Steiner Tree Problem; Steiner Tree Problem with Bounded Component Sizes; Steiner Tree Problem under Given Topologies; Steiner Tree Problem for Minimal Number of Steiner Points; Bottleneck Steiner Tree Problem; Terminal Steiner Tree Problem; Steiner Tree Problem with Grade of Services; Survivable Steiner Network Problem.

Erscheint lt. Verlag	25.2.2008
Verlagsort	Singapore
Sprache	englisch
Themenwelt	Mathematik / Informatik ► Informatik ► Netzwerke
	Mathematik / Informatik ► Informatik ► Theorie / Studium
	Mathematik / Informatik ► Mathematik
ISBN-13	9789812791443 / 9789812791443
Zustand	Neuware