A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints - Université d'Évry
Journal Articles Operations Research Letters Year : 2023

A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints

Abstract

We study the multiple Hamiltonian path problem (MHPP) defined on a complete undirected graph G with n vertices. The edge weights of G are non-negative and satisfy the triangle inequality. The MHPP seeks to find a collection of k paths with exactly one visit to each vertex of G with the minimum total edge weight, where endpoints of the paths are not prefixed. We present a 3/2-approximation algorithm for MHPP with time complexity O(n3) for arbitrary k≥1.
No file

Dates and versions

hal-04180029 , version 1 (11-08-2023)

Identifiers

Cite

Jun Wu, Yongxi Cheng, Zhen Yang, Feng Chu. A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints. Operations Research Letters, 2023, 51 (5), pp.473--476. ⟨10.1016/j.orl.2023.07.003⟩. ⟨hal-04180029⟩
41 View
0 Download

Altmetric

Share

More