On Accuracy of Approximation for the Resource Constrained Shortest Path Problem

The paper we considers the Resource Constrained Shortest Path problem (RCSP). This problem is NP- hard extension of a well-known shortest path problem in the directed graph G = (V;E). In the RCSP problem each arc e from E has a cost w(e) and additional weight functions ri(e); i = 1; : : : ; k, which...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of Siberian Federal University. Mathematics & Physics Ročník 12; číslo 5; s. 621 - 627
Hlavný autor:	Soldatenko, Aleksandr A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Krasnoyarsk Siberian Federal University 01.01.2019
Predmet:	Algorithms Approximation Critical path Graph theory Graphs Mathematical analysis Polynomials Shortest-path problems Weighting functions
ISSN:	1997-1397, 2313-6022
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!