The Shortest Path Problem with Edge Information Reuse is NP-Complete.
Jesper Larsson TräffPublished in: CoRR (2015)
Keyphrases
- edge information
- shortest path problem
- np complete
- shortest path
- single source
- region growing
- edge detection
- combinatorial optimization problems
- interval data
- np hard
- computational complexity
- strong edges
- multiple objectives
- shadow detection
- directed graph
- edge map
- shape features
- multiscale
- image processing
- single image
- directed acyclic graph
- genetic programming
- special case
- lower bound
- shadow removal
- genetic algorithm