On the complexity of minimum-link path problems.

Irina Kostitsyna Maarten Löffler Valentin Polishchuk Frank Staals

Published in: J. Comput. Geom. (2017)

Keyphrases

optimization problems
decision problems
computational complexity
problems involving
worst case
social networks
combinatorial optimization
tractable cases
machine learning
polynomial hierarchy
np hardness
application domains
np complete
upper bound
multi agent systems
image sequences
genetic algorithm