Maximum shortest path interdiction problem by upgrading edges on trees under hamming distance.
Qiao ZhangXiucui GuanHui WangPanos M. PardalosPublished in: Optim. Lett. (2021)
Keyphrases
- shortest path
- hamming distance
- weighted graph
- edge weights
- shortest path problem
- binary strings
- steiner tree
- pattern matching
- distance measure
- strongly connected components
- shortest path algorithm
- road network
- path length
- maximum flow
- routing algorithm
- directed graph
- hash functions
- shortest distance
- binary codes
- spanning tree
- finding the shortest path
- minimum spanning tree
- edit distance
- pattern recognition
- optimal path
- directed acyclic graph
- reinforcement learning