An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance.
Yi LeiHu ShaoTing WuPengjie LiuPublished in: Optim. Lett. (2023)
Keyphrases
- shortest path
- hamming distance
- shortest path problem
- weighted graph
- optimal solution
- dynamic programming
- shortest path algorithm
- matching algorithm
- path length
- dijkstra algorithm
- optimal path
- finding the shortest path
- spanning tree
- shortest distance
- minimum cost flow
- steiner tree
- edge weights
- recognition algorithm
- np hard
- similarity measure
- graph structure
- minimum spanning tree
- distance metric
- pattern matching
- high dimensional
- objective function