Delineates P vs NP-hard boundaries for LiDARP and MinTurn by instance parameters and supplies parameterized algorithms.
Discrete Mathematics306(19), 2529–2571 (2006)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative 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.
- Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds