ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015


Article Details
Title: Brief Announcement: Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths
Article URLs:
Alternative Article URLs:
Authors: Longkun Guo
  • Fuzhou University, China, School of Mathematics and Computer Science
Kewen Liao
  • University of Melbourne, Australia, Dept. of Computing and Information Systems
Hong Shen
  • University of Adelaide, Australia, School of Computer Science
Peng Li
  • Washington University in St. Louis, United States, Dept. of Computer Science and Engineering
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/spaa/GuoLSL15
Author Comments:

Discuss this paper and its artifacts below