STEINER TREE PROBLEMS IN COMPUTER COMMUNICATION NETWORKS

计算机通信网络中的Steiner树问题

计算机科学技术基础学科

原   价:
1410.00
售   价:
1057.00
发货周期:预计3-5周发货
作      者
出  版 社
出版时间
2008年02月25日
装      帧
精装
ISBN
9789812791443
复制
页      码
376
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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. Key Feature • The first author, Dingzhu Du, received the CSTS prize from INFORMS for research excellence in the interface between operations research and computer science, including his important work on Steiner tree problems
馆藏图书馆
Yale University Library
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个