Steiner tree problems in computer communication networks

著者

書誌事項

Steiner tree problems in computer communication networks

Dingzhu Du, Xiaodong Hu

World Scientific, c2008

大学図書館所蔵 件 / 1

この図書・雑誌をさがす

注記

Includes bibliographical references and index

内容説明・目次

内容説明

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.

「Nielsen BookData」 より

詳細情報

  • NII書誌ID(NCID)
    BB30913014
  • ISBN
    • 9789812791443
  • LCCN
    99048251
  • 出版国コード
    si
  • タイトル言語コード
    eng
  • 本文言語コード
    eng
  • 出版地
    Singapore
  • ページ数/冊数
    xiii, 359 p.
  • 大きさ
    24 cm
ページトップへ