Algorithms for the shortest path improvement problems under unit Hamming distance

DOI10.1155/2013/847317zbMath1397.90389OpenAlexW2166042729WikidataQ59004819 ScholiaQ59004819MaRDI QIDQ1791343

Chunyuan He, Shuguo Wang, Bingwu Zhang, Xiucui Guan

Publication date: 10 October 2018

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/847317

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Efficient algorithms for the reverse shortest path problem on trees under the hamming distance

This page was built for publication: Algorithms for the shortest path improvement problems under unit Hamming distance