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

DOI10.2298/YJOR150624009TzbMath1474.90387MaRDI QIDQ4987673

Javad Tayyebi, Massoud Aman

Publication date: 3 May 2021

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

inverse problems; Hamming distance; shortest path problem; combinatorial algorithms

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization

05C85: Graph algorithms (graph-theoretic aspects)