Algorithms for the Shortest Path Improvement Problems under Unit Hamming Distance
In a shortest path improvement problem under unit Hamming distance (denoted by SPIUH), an edge weighted graph with a set of source-terminal pairs is given; we need to modify the lengths of edges by a minimum cost under unit Hamming distance such that the modified distances of the shortest paths are...
Main Authors: | Bingwu Zhang, Xiucui Guan, Chunyuan He, Shuguo Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/847317 |
Similar Items
-
Efficient algorithms for the reverse shortest path problem on trees under the hamming distance
by: Tayyebi Javad, et al.
Published: (2017-01-01) -
An improved Algorithm for the shortest path problem with forbidden paths
by: Hua-yuan Ding, et al.
Published: (2007) -
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
by: Xiaoge Zhang, et al.
Published: (2014-01-01) -
An Algorithm for the Cycled Shortest Path Problem
by: Amir Salehipour, et al.
Published: (2011-07-01) -
Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks
by: Glenn, Andrew M., 1978-
Published: (2014)