A polynomial algorithm for the most degree-central shortest path problem.
Johnson PhosavanhDmytro MatsypuraPublished in: CoRR (2024)
Keyphrases
- shortest path problem
- preprocessing
- shortest path
- matching algorithm
- interval data
- combinatorial optimization
- high accuracy
- k means
- single source
- dynamic programming
- optimization algorithm
- detection algorithm
- combinatorial optimization problems
- cost function
- significant improvement
- search space
- directed graph
- recognition algorithm
- experimental evaluation
- linear programming
- computational cost
- np hard
- optimal solution
- expectation maximization
- bicriteria
- multiple objectives
- minimum length
- benchmark problems
- search strategy
- times faster
- neural network
- special case
- computational complexity
- clustering algorithm
- learning algorithm