Worst Case Bounds for Shortest Path Interval Routing

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.27, Iss.1, 1998-04, pp. : 1-25

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the complexity of equal shortest path routing

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 4, 2015-07 ,pp. : 344-352

John Wiley & Sons Inc

Access to resources Recommend Favorite

Open shortest path first routing under random early detection

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 71, Iss. 2, 2018-03 ,pp. : 120-135

John Wiley & Sons Inc

Access to resources Recommend Favorite

A branch and bound algorithm for the robust shortest path problem with interval data

By Montemanni R. Gambardella L.M. Donati A.V.

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 225-232

Elsevier

Access to resources Recommend Favorite

Worst case complexity of multivariate Feynman-Kac path integration

By Kwas M. Li Y.

Journal of Complexity, Vol. 19, Iss. 6, 2003-12 ,pp. : 730-743

Elsevier

Access to resources Recommend Favorite

A New Algorithm and Worst Case Complexity for Feynman–Kac Path Integration

By Plaskota L. Wasilkowski G.W. Woźniakowski H.

Journal of Computational Physics, Vol. 164, Iss. 2, 2000-11 ,pp. : 335-353

Academic Press

Access to resources Recommend Favorite