Delineates P vs NP-hard boundaries for LiDARP and MinTurn by instance parameters and supplies parameterized algorithms.
Thus, the service promise is always kept and this case is equivalent to there being no service promise
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.