A linear time algorithm for linearizing quadratic and higher-order shortest path problems.
Eranda ÇelaBettina KlinzStefan LendlGerhard J. WoegingerLasse WulfPublished in: CoRR (2023)
Keyphrases
- shortest path problem
- higher order
- pairwise
- shortest path
- single source
- interval data
- combinatorial optimization problems
- natural images
- multiple objectives
- high order
- steiner tree
- markov random field
- low order
- objective function
- directed acyclic graph
- directed graph
- conditional random fields
- lower order
- computational complexity
- lambda calculus
- markov models
- cost function
- spline interpolation
- search algorithm