Steiner tree problems in computer communication networks

Author(s)

Bibliographic Information

Steiner tree problems in computer communication networks

Dingzhu Du, Xiaodong Hu

World Scientific, c2008

Available at  / 1 libraries

Search this Book/Journal

Note

Includes bibliographical references and index

Description and Table of Contents

Description

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.

Table of Contents

  • 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.

by "Nielsen BookData"

Details

  • NCID
    BB30913014
  • ISBN
    • 9789812791443
  • LCCN
    99048251
  • Country Code
    si
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Singapore
  • Pages/Volumes
    xiii, 359 p.
  • Size
    24 cm
Page Top