scientific article

zbMath1346.68118MaRDI QIDQ3466912

Xiucui Guan, Samson Hansen Sackey, Chunyuan He, Qin Wang, Binwu Zhang

Publication date: 25 January 2016

Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol11/p605.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hamming distanceheuristic algorithminapproximabilityshortest path improvement problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance

This page was built for publication: