Crossmark

Efficient approximation algorithms for computing k disjoint constrained shortest paths

Crossref DOI link: https://doi.org/10.1007/s10878-015-9934-2

Published Online: 2015-07-23

Published Print: 2016-07

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Guo, Longkun
Funding

Funding for this research was provided by:

Natural Science Foundation of China (61300025)

Doctoral Funds of Ministry of Education of China for Young Scholars (20123514120013)

Natural Science Foundation of Fujian Province (2012J05115)
License Information

Text and Data Mining valid from 2015-07-23