Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations

Bing Yang, S. Q. Zheng. Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations. In Jin-yi Cai, S. Barry Cooper, Angsheng Li, editors, Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings. Volume 3959 of Lecture Notes in Computer Science, pages 206-216, Springer, 2006. [doi]

Abstract

Abstract is missing.