Steiner tree problems in computer communication networks / Dingzhu Du, Xiaodong Hu.
نوع المادة :![نص](/opac-tmpl/lib/famfamfam/BK.png)
- text
- unmediated
- volume
- 9812791442
- 9789812791443
- QA166.3 .D8 2008
نوع المادة | المكتبة الحالية | رقم الطلب | رقم النسخة | حالة | تاريخ الإستحقاق | الباركود | |
---|---|---|---|---|---|---|---|
![]() |
UAE Federation Library | مكتبة اتحاد الإمارات General Collection | المجموعات العامة | QA166.3 .D8 2008 (إستعراض الرف(يفتح أدناه)) | C.1 | Library Use Only | داخل المكتبة فقط | 30020000014463 |
Browsing UAE Federation Library | مكتبة اتحاد الإمارات shelves, Shelving location: General Collection | المجموعات العامة إغلاق مستعرض الرف(يخفي مستعرض الرف)
QA166 W38 1999 Small worlds : the dynamics of networks between order and randomness / | QA166.243 .N34 2019 Algorithmic aspects of graph connectivity / | QA166.243 .N34 2019 Algorithmic aspects of graph connectivity / | QA166.3 .D8 2008 Steiner tree problems in computer communication networks / | QA166.6 .W44 2010 Matroid theory / | QA166.6 .W44 2010 Matroid theory / | QA174.2 .C372 2017 Groups, matrices, and vector spaces : a group theoretic approach to linear algebra / |
Includes bibliographical references (pages 337-353) and index.
Fundamentals of classical Steiner tree problem -- Minimax approach and Steiner ratio -- k-Steiner ratios and better approximation algorithms -- Geometric partitions and polynomial time -- 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.
"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."--Jacket.