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

Saved in:
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!
Abstract 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
AbstractList 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
The paper we considers the Resource Constrained Shortest Path problem (RCSP). This problem is NPhard 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 = k, which specifying its requirements from a finite set of resource. A polynomial time e-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 e approximation of the RCSP problem in O(\V|2) time. The present paper provides a proof of complexity and aproximation of RevTree algorithm.
Author Soldatenko, Aleksandr A.
Author_xml – sequence: 1
  givenname: Aleksandr A.
  surname: Soldatenko
  fullname: Soldatenko, Aleksandr A.
  organization: Siberian Federal University
BookMark eNo9kEtrQyEQhaWk0DTNfxDara2jV63QTQh9QeCGPtaixksSEk31Bpp_X9OULmZmMYeZc75LNIgpBoRugN6CEiDvQGtFgNfGKGgCjAgiGdRSZ2jIOHAiKWMDNPxXXqBxKWtKKdOy4VwNUdtGPPF-n60_4NThyW6X0_dqa_tVirhLGffLgN9CSfvsA56mWPpsVzEs8Psy5T6UHs9tv8TznNwmbK_QeWc3JYz_5gh9Pj1-TF_IrH1-nU5mxDNNe-JF50SjXbC80QCNkxSct6CV13qhZOM8k8IH1lDOOupsR4WuisV93Som-Qhdn-5Wu1_76sKsq8NYX5qaXGrFtBZV9XBS-ZxKyaEzu1yz5YMBan4pmiMbc2RjjhQNMCNMpVhL8R_ur2cj
Cites_doi 10.1287/opre.42.5.977
10.1016/0022-247X(66)90020-5
10.1002/net.10090
10.1016/j.disopt.2014.08.001
10.1007/3-540-45253-2_30
10.1109/tnet.2007.900712
10.1016/j.cor.2016.04.013
10.1287/moor.17.1.36
ContentType Journal Article
Copyright 2019. This work is published under NOCC (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2019. This work is published under NOCC (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
8FE
8FG
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
BYOGL
CCPQU
DWQXO
HCIFZ
L6V
M7S
P5Z
P62
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.17516/1997-1397-2019-12-5-621-627
DatabaseName CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
East Europe, Central Europe Database
ProQuest One Community College
ProQuest Central
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering collection
DatabaseTitle CrossRef
Publicly Available Content Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Engineering Database
ProQuest One Academic Eastern Edition
East Europe, Central Europe Database
ProQuest Technology Collection
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList CrossRef
Publicly Available Content Database
Database_xml – sequence: 1
  dbid: BYOGL
  name: East Europe, Central Europe Database
  url: https://search.proquest.com/eastcentraleurope
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
EISSN 2313-6022
EndPage 627
ExternalDocumentID 10_17516_1997_1397_2019_12_5_621_627
GroupedDBID 5IG
8FE
8FG
AAYXX
ABJCF
ABUWG
ACIWK
AFFHD
AFKRA
ALMA_UNASSIGNED_HOLDINGS
ARAPS
BENPR
BGLVJ
BPHCQ
BYOGL
CCPQU
CITATION
E4X
HCIFZ
L6V
M7S
P62
PHGZM
PHGZT
PIMPY
PQGLB
PQQKQ
PROAC
PTHSS
AZQEC
DWQXO
PKEHL
PQEST
PQUKI
PRINS
ID FETCH-LOGICAL-c290t-c5fb549bea349114b601bca197c99d764bc265ce24032f0baf0591bcd89d77263
IEDL.DBID M7S
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000501589200011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1997-1397
IngestDate Fri Jul 25 11:51:57 EDT 2025
Sat Nov 29 03:08:45 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 5
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c290t-c5fb549bea349114b601bca197c99d764bc265ce24032f0baf0591bcd89d77263
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://www.proquest.com/docview/2316972995?pq-origsite=%requestingapplication%
PQID 2316972995
PQPubID 2035022
PageCount 7
ParticipantIDs proquest_journals_2316972995
crossref_primary_10_17516_1997_1397_2019_12_5_621_627
PublicationCentury 2000
PublicationDate 2019-01-01
PublicationDateYYYYMMDD 2019-01-01
PublicationDate_xml – month: 01
  year: 2019
  text: 2019-01-01
  day: 01
PublicationDecade 2010
PublicationPlace Krasnoyarsk
PublicationPlace_xml – name: Krasnoyarsk
PublicationTitle Journal of Siberian Federal University. Mathematics & Physics
PublicationYear 2019
Publisher Siberian Federal University
Publisher_xml – name: Siberian Federal University
References ref8
ref7
ref9
ref4
ref3
ref6
ref5
ref10
ref0
ref2
ref1
References_xml – ident: ref2
  doi: 10.1287/opre.42.5.977
– ident: ref1
  doi: 10.1016/0022-247X(66)90020-5
– ident: ref3
– ident: ref4
  doi: 10.1002/net.10090
– ident: ref6
  doi: 10.1016/j.disopt.2014.08.001
– ident: ref8
– ident: ref0
– ident: ref5
  doi: 10.1007/3-540-45253-2_30
– ident: ref10
  doi: 10.1109/tnet.2007.900712
– ident: ref7
  doi: 10.1016/j.cor.2016.04.013
– ident: ref9
  doi: 10.1287/moor.17.1.36
SSID ssj0002964337
Score 2.0590994
Snippet 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...
The paper we considers the Resource Constrained Shortest Path problem (RCSP). This problem is NPhard extension of a well-known shortest path problem in the...
SourceID proquest
crossref
SourceType Aggregation Database
Index Database
StartPage 621
SubjectTerms Algorithms
Approximation
Critical path
Graph theory
Graphs
Mathematical analysis
Polynomials
Shortest-path problems
Weighting functions
Title On Accuracy of Approximation for the Resource Constrained Shortest Path Problem
URI https://www.proquest.com/docview/2316972995
Volume 12
WOSCitedRecordID wos000501589200011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 2313-6022
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002964337
  issn: 1997-1397
  databaseCode: P5Z
  dateStart: 20140401
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: East Europe, Central Europe Database
  customDbUrl:
  eissn: 2313-6022
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002964337
  issn: 1997-1397
  databaseCode: BYOGL
  dateStart: 20140401
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/eastcentraleurope
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 2313-6022
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002964337
  issn: 1997-1397
  databaseCode: M7S
  dateStart: 20140401
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central - New (Subscription)
  customDbUrl:
  eissn: 2313-6022
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002964337
  issn: 1997-1397
  databaseCode: BENPR
  dateStart: 20140401
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 2313-6022
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002964337
  issn: 1997-1397
  databaseCode: PIMPY
  dateStart: 20140401
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELaAIsTCQ4Aoj8pD16iJG8fxhAqigoE2oiAVFit-RHRpS1sQ_HvunLSoCwuDM9gZkrvL3efz5T5CmlwUENUsVqqZPIi5C4M8T1yQMp2mtohclGpPNiF6vXQ4lFmVcJtXZZVLn-gdtZ0YzJG3AIckEpCg5FfT9wBZo_B0taLQ2CQ17JIQ-dK9wSrHgkeKbd820zcdRbCzQ5roJwSPktZqEkwlKkkBgoRFMMR6lFp30j7ydPf_-8wHZK_CnLRTGskh2XDjI9Lvj2nHmI9Zbr7ppKAdbC7-NSr_ZKQAZSlAQ7rM7lMk9vR0Es7SwRtW6M4XNAP4SLOSkuaYPHdvn27ugopdITBMhovA8ELD5lC7vB2Dx4s1bM20ySMpjJRWJLE2LOHGYcM-VoQ6LwCJwR02hVXBkvYJ2RpPxu6UUC4Ys1zK2AIAhBfWTlombK6LJIx1GNcJX0pTTcsmGgo3H6gFhVpQqAWFWlARU1yBFmCIOrlYylVVn9Zc_Qr17O_lc7Lr9erzJRdkazH7cJdk23wuRvNZg9Sub3vZY8NbDFwz_gpz2f1D9vIDJoHGqQ
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9tAEB7RgFouBUSr0vLYAxwt7I3X6z2gKmqJEpEESwQJTlvvwyoXhyahhT_Fb-yMHYO4cMuBw168liXvNzvzzT7mAzgUssCo5uikms2DWPgwyPPEByk3aeqKyEepqcQm5GiUXl2pbAUem7swdKyy8YmVo3YTS2vkx8hDEoVMUInvt38CUo2i3dVGQqM2izP_8A9TttlJ_yfie8R593T8oxcsVAUCy1U4D6woDCZFxuftGGd6bDAlMTaPlLRKOZnExvJEWE-F6ngRmrxABoJvuBR7JU_a-N13sBqTsbdgNesPs-unVR3axGxXhTqrMqdEr97DIXkmKaLk-OkhGmdUyxAECY-wyZdx8WVYqGJdd-OtjdImfFywatapp8EWrPhyG87PS9ax9m6a2wc2KViHyqff39R3NRmSdYbklzX7F4ykSyvBDO_YxW86gzybswwJMstq0Z1PcLmUf_gMrXJS-i_AhOTcCaVihxQXB9h45bh0uSmSMDZhvAOiQU_f1mVCNKVXhLom1DWhrgl1HXEtNKKOTe7AboOjXjiPmX4G8evr3QfwoTceDvSgPzr7BuuVTVWrQ7vQmk_v_B6s2b_zm9l0f2GnDH4tG_T_mzEgdg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3Pb9MwFH4a3TRxgaGBKJThwzhGTdw4jg8IVYyKaaiLBJOqXUz8I9oubWlSoP8afx3vOc1QL9x22MGXOIoUv8_P37Of3wdwKmSFq5qjTDVbRqnwcVSWmY9ybvLcVYlPchPEJuR0ms9mqtiDP91dGEqr7HxicNRuYWmPfIg8JFPIBJUYVtu0iOJs8mH5IyIFKTpp7eQ0Wohc-M0vDN_q9-dnaOt3nE8-ffv4OdoqDESWq7iJrKgMBkjGl6MUZ31qMDwxtkyUtEo5maXG8kxYT0XreBWbskI2gm-4HHslz0b43UewLzHGpHTCQlzf7e_QceYolOwMBU-JaB3CKfkoKZJsePcQYZq0ggRRxhNscneF3F0gwqo3efqQx-sInmy5Nhu3k-MZ7Pn5MVxeztnY2vWqtBu2qNiYiqr_vm1vcDKk8AwpMetONRgJmgYZDe_Y1xvKTK4bViBtZkUrxfMcru7lH15Ab76Y-5fAhOTcCaVSh8QXB9t45bh0pamyODVx2gfRWVIv2-IhmoIuQoAmBGhCgCYE6IRroREB2GQfBp1N9dal1PqfQV_9v_stHKKl9Zfz6cVreBzgFbaMBtBrVmv_Bg7sz-a2Xp0EwDL4ft8W_wvU7ifZ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+Accuracy+of+Approximation+for+the+Resource+Constrained+Shortest+Path+Problem&rft.jtitle=Journal+of+Siberian+Federal+University.+Mathematics+%26+Physics&rft.au=Soldatenko%2C+Aleksandr+A.&rft.date=2019-01-01&rft.issn=1997-1397&rft.eissn=2313-6022&rft.spage=621&rft.epage=627&rft_id=info:doi/10.17516%2F1997-1397-2019-12-5-621-627&rft.externalDBID=n%2Fa&rft.externalDocID=10_17516_1997_1397_2019_12_5_621_627
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1997-1397&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1997-1397&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1997-1397&client=summon