scientific article; zbMATH DE number 5631939

MaRDI QIDQ3644697zbMATH OpenFDO

Authors Binwu Zhang, Qin Wang, Weiyan Yu

Publication date 11 November 2009

zbMATH Keywords

Hamming distanceapproximation algorithmNP-hardnessshortest path improvement problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• The shortest path improvement problems under Hamming distance
• Algorithms for the shortest path improvement problems under unit Hamming distance
• The complexity analysis of the shortest path improvement problem under the Hamming distance
• An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
• An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance
• Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance
• Improvement of shortest path of arborescent network in the case of Hamming distance
• An Improved Distribution Algorithm for Shortest Paths Problem
• Efficient algorithms for the reverse shortest path problem on trees under the Hamming distance
• scientific article; zbMATH DE number 1445365

Cited in

(7)

• The complexity analysis of the shortest path improvement problem under the Hamming distance
• Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance
• The center location improvement problem under the Hamming distance
• Improvement of shortest path of arborescent network in the case of Hamming distance
• The shortest path improvement problems under Hamming distance
• Algorithms for the shortest path improvement problems under unit Hamming distance
• An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644697)