If the toursri−1 and ri have different directions one turn is needed

+ ts + δ · tturn, with δ being the number of turns necessary between the two waypoints

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

cs.CC · 2024-09-23 · unverdicted · novelty 5.0

Delineates P vs NP-hard boundaries for LiDARP and MinTurn by instance parameters and supplies parameterized algorithms.

Showing 1 of 1 citing paper.

The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem cs.CC · 2024-09-23 · unverdicted · none · ref 20
Delineates P vs NP-hard boundaries for LiDARP and MinTurn by instance parameters and supplies parameterized algorithms.