首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A faster algorithm for the single source shortest path problem with few distinct positive lengths
Authors:James B Orlin  Kamesh Madduri  K Subramani  M Williamson
Institution:1. Sloan School of Management, MIT, Cambridge, MA, USA;2. Computational Research Division, Lawrence Berkeley Laboratory, Berkeley, CA, USA;3. LDCSEE, West Virginia University, Morgantown, WV, USA
Abstract:
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号