The Shortest Path Problem(DIMACS: Series in Discrete Mathematics and Theoretical Com)

*短路问题:第9届 DIMACS 实施挑战

组合数学

售   价:
981.00
发货周期:国外库房发货,通常付款后3-5周到货!
作      者
出版时间
2009年08月30日
装      帧
精装
ISBN
9780821843833
复制
页      码
319
开      本
27 cm.
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. They arise naturally in a remarkable number of real-world settings. A limited list includes transportation planning, network optimization, packet routing, image segmentation, speech recognition, document formatting, robotics, compilers, traffic information systems, and dataflow analysis. Shortest path algorithms have been studied since the 1950’s and still remain an active area of research. This volume reports on the research carried out by participants during the Ninth DIMACS Implementation Challenge, which led to several improvements of the state of the art in shortest path algorithms. The infrastructure developed during the Challenge facilitated further research in the area, leading to substantial follow-up work as well as to better and more uniform experimental standards. The results of the Challenge included new cutting-edge techniques for emerging applications such as GPS navigation systems, providing experimental evidence of the most effective algorithms in several real-world settings. Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1-7 were co-published with the Association for Computer Machinery (ACM).
馆藏图书馆
Yale University Library
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个