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ženo v:
Podrobná bibliografie
Vydáno 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:angličtina
Vydáno: Krasnoyarsk Siberian Federal University 01.01.2019
Témata:
Algorithms
Approximation
Critical path
Graph theory
Graphs
Mathematical analysis
Polynomials
Shortest-path problems
Weighting functions
ISSN:1997-1397, 2313-6022
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 specifying its requirements from a finite set of resource. A polynomial time ϵ-approximation algorithm RevTree based on node labeling method is presented in the paper. The main advantage of the RevTree algorithm over existing ones is its ability to produce ϵ approximation of the RCSP problem in O(jV j2) time. The present paper provides a proof of complexity and aproximation of RevTree algorithm
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1997-1397
2313-6022
DOI:10.17516/1997-1397-2019-12-5-621-627