Steiner Tree Problems In Computer Communication Networks
Book Details
Format
Hardback or Cased Book
ISBN-10
9812791442
ISBN-13
9789812791443
Publisher
World Scientific Publishing Co Pte Ltd
Imprint
World Scientific Publishing Co Pte Ltd
Country of Manufacture
SG
Country of Publication
GB
Publication Date
Feb 25th, 2008
Print length
376 Pages
Weight
656 grams
Dimensions
23.50 x 16.10 x 2.50 cms
Product Classification:
Mathematical theory of computation
Ksh 21,600.00
Re-Printing
Delivery Location
Delivery fee: Select location
Secure
Quality
Fast
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.
Get Steiner Tree Problems In Computer Communication Networks by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by World Scientific Publishing Co Pte Ltd and it has pages.
