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...

Full description

Bibliographic Details

Published in:	Journal of Siberian Federal University. Mathematics & Physics Vol. 12; no. 5; pp. 621 - 627
Main Author:	Soldatenko, Aleksandr A.
Format:	Journal Article
Language:	English
Published:	Krasnoyarsk Siberian Federal University 01.01.2019
Subjects:	Algorithms Approximation Critical path Graph theory Graphs Mathematical analysis Polynomials Shortest-path problems Weighting functions
ISSN:	1997-1397, 2313-6022
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!