Publisher: John Wiley & Sons Inc
E-ISSN: 1097-0037|71|2|120-135
ISSN: 0028-3045
Source: NETWORKS: AN INTERNATIONAL JOURNAL, Vol.71, Iss.2, 2018-03, pp. : 120-135
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On the complexity of equal shortest path routing
NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 4, 2015-07 ,pp. :
Worst Case Bounds for Shortest Path Interval Routing
Journal of Algorithms, Vol. 27, Iss. 1, 1998-04 ,pp. :
Robust constrained shortest path problems under budgeted uncertainty
NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 66, Iss. 2, 2015-09 ,pp. :