STEINER TREE PROBLEMS IN COMPUTER COMMUNICATION NETWORKS - Hardcover

Du, Ding-Zhu; Hu, Xiaodong

 
9789812791443: STEINER TREE PROBLEMS IN COMPUTER COMMUNICATION NETWORKS
Hardcover
ISBN 10: 9812791442 ISBN 13: 9789812791443
Publisher: World Scientific Publishing Company, 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.

"synopsis" may belong to another edition of this title.

Review

This book will clearly be of interest to experts in combinatorial optimization, graph theory, and computer communication networks. --Mathematical Reviews

"About this title" may belong to another edition of this title.

Publisher
World Scientific Publishing Company
Publication date
2008
Language
English
ISBN 10 
9812791442
ISBN 13 
9789812791443
Binding
Hardcover
Number of pages
376