skip to content
Steiner tree problems in computer communication networks Preview this item
ClosePreview this item
Checking...

Steiner tree problems in computer communication networks

Author: Dingzhu Du; Xiaodong Hu
Publisher: Singapore ; Hackensack, NJ : World Scientific, ©2008.
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Summary:
"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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Dingzhu Du; Xiaodong Hu
ISBN: 9812791442 9789812791443
OCLC Number: 191658455
Description: xiii, 359 pages : illustrations ; 24 cm
Contents: 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.
Responsibility: Dingzhu Du, Xiaodong Hu.
More information:

Abstract:

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  Read more...

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(2)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/191658455> # Steiner tree problems in computer communication networks
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "191658455" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/119666414#Place/singapore> ; # Singapore
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/si> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/119666414#Place/hackensack_nj> ; # Hackensack, NJ
   schema:about <http://id.worldcat.org/fast/1132934> ; # Steiner systems
   schema:about <http://dewey.info/class/004.6/e22/> ;
   schema:about <http://id.worldcat.org/fast/872297> ; # Computer networks
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://viaf.org/viaf/50851821> ; # Xiaodong Hu
   schema:copyrightYear "2008" ;
   schema:creator <http://experiment.worldcat.org/entity/work/data/119666414#Person/du_dingzhu> ; # Dingzhu Du
   schema:datePublished "2008" ;
   schema:description "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."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/119666414> ;
   schema:inLanguage "en" ;
   schema:name "Steiner tree problems in computer communication networks"@en ;
   schema:productID "191658455" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/191658455#PublicationEvent/singapore_hackensack_nj_world_scientific_2008> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/119666414#Agent/world_scientific> ; # World Scientific
   schema:reviews <http://www.worldcat.org/title/-/oclc/191658455#Review/-1382856597> ;
   schema:url <http://catdir.loc.gov/catdir/toc/fy0805/2008299551.html> ;
   schema:workExample <http://worldcat.org/isbn/9789812791443> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/191658455> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/119666414#Agent/world_scientific> # World Scientific
    a bgn:Agent ;
   schema:name "World Scientific" ;
    .

<http://experiment.worldcat.org/entity/work/data/119666414#Person/du_dingzhu> # Dingzhu Du
    a schema:Person ;
   schema:familyName "Du" ;
   schema:givenName "Dingzhu" ;
   schema:name "Dingzhu Du" ;
    .

<http://id.worldcat.org/fast/1132934> # Steiner systems
    a schema:Intangible ;
   schema:name "Steiner systems"@en ;
    .

<http://id.worldcat.org/fast/872297> # Computer networks
    a schema:Intangible ;
   schema:name "Computer networks"@en ;
    .

<http://viaf.org/viaf/50851821> # Xiaodong Hu
    a schema:Person ;
   schema:familyName "Hu" ;
   schema:givenName "Xiaodong" ;
   schema:name "Xiaodong Hu" ;
    .

<http://worldcat.org/isbn/9789812791443>
    a schema:ProductModel ;
   schema:isbn "9812791442" ;
   schema:isbn "9789812791443" ;
    .

<http://www.worldcat.org/title/-/oclc/191658455#Review/-1382856597>
    a schema:Review ;
   schema:itemReviewed <http://www.worldcat.org/oclc/191658455> ; # Steiner tree problems in computer communication networks
   schema:reviewBody ""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." ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.