Delineates P vs NP-hard boundaries for LiDARP and MinTurn by instance parameters and supplies parameterized algorithms.
Thus, each passenger always arrives after their direct time dis- tance at their destination, regardless of other passengers transported by the vehicle
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
Delineates P vs NP-hard boundaries for LiDARP and MinTurn by instance parameters and supplies parameterized algorithms.