Multi-constraint shortest path using forest hop labeling

The Multi-Constraint Shortest Path (MCSP) problem aims to find the shortest path between two nodes in a network subject to a given constraint set. It is typically processed as a skyline path problem. However, the number of intermediate skyline paths becomes larger as the network size increases and t...

Full description

Saved in:
Bibliographic Details
Published inThe VLDB journal Vol. 32; no. 3; pp. 595 - 621
Main Authors Liu, Ziyi, Li, Lei, Zhang, Mengxuan, Hua, Wen, Zhou, Xiaofang
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2023
Springer Nature B.V
Subjects
Online AccessGet full text

Cover

Loading…