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

Jun Wu; Yongxi Cheng; Zhen Yang; Feng Chu

doi:10.1016/j.orl.2023.07.003

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

Jun Wu
, Yongxi Cheng
, Zhen Yang
, Feng Chu

School of Management

Xi'an Jiaotong University
Université Paris-Saclay

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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(n³) for arbitrary k≥1.

Original language	English
Pages (from-to)	473-476
Number of pages	4
Journal	Operations Research Letters
Volume	51
Issue number	5
DOIs	https://doi.org/10.1016/j.orl.2023.07.003
State	Published - Sep 2023

Keywords

Approximation algorithm
Christofides heuristic
Multiple Hamiltonian path problem

Access to Document

10.1016/j.orl.2023.07.003

Cite this

@article{ef41589b7a234f5c8fb080ee224143dc,

title = "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.",

keywords = "Approximation algorithm, Christofides heuristic, Multiple Hamiltonian path problem",

author = "Jun Wu and Yongxi Cheng and Zhen Yang and Feng Chu",

note = "Publisher Copyright: {\textcopyright} 2023 Elsevier B.V.",

year = "2023",

month = sep,

doi = "10.1016/j.orl.2023.07.003",

language = "英语",

volume = "51",

pages = "473--476",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "5",

}

TY - JOUR

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

AU - Wu, Jun

AU - Cheng, Yongxi

AU - Yang, Zhen

AU - Chu, Feng

PY - 2023/9

Y1 - 2023/9

N2 - 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.

AB - 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.

KW - Approximation algorithm

KW - Christofides heuristic

KW - Multiple Hamiltonian path problem

UR - https://www.scopus.com/pages/publications/85166185757

U2 - 10.1016/j.orl.2023.07.003

DO - 10.1016/j.orl.2023.07.003

M3 - 文章

AN - SCOPUS:85166185757

SN - 0167-6377

VL - 51

SP - 473

EP - 476

JO - Operations Research Letters

JF - Operations Research Letters

IS - 5

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this