Thumbnail

Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)

Monnot, Jérôme (2005), Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s), European Journal of Operational Research, 161, 3, p. 721-735. http://dx.doi.org/10.1016/j.ejor.2003.09.007

View/Open
Type
Article accepté pour publication ou publié
Date
2005
Journal name
European Journal of Operational Research
Volume
161
Number
3
Publisher
Elsevier
Pages
721-735
Publication identifier
Metadata
Show full item record
Author(s)
Monnot, Jérôme cc
Abstract (EN)
This paper deals with the problem of constructing Hamiltonian paths of optimal weight, called HPPs,t if the two endpoints are specified, HPPs if only one endpoint is specified. We show that HPPs,t is Image -differential approximable and HPPs is Image -differential approximable. Moreover, we observe that these problems cannot be differential approximable better than Image . Based upon these results, we obtain new bounds for standard ratio: a Image -standard approximation for MImage HPPs,t and a Image for MImage HPPs, which can be improved to Image for MImage HPPs,t[a,2a] (all the edge weights are within an interval [a,2a]), to Image for MImage HPPs[a,2a] and to Image for MImage HPPs,t[a,2a], to Image for MImage HPPs[a,2a].
Subjects / Keywords
Hamiltonian paths; Analysis of algorithms; performance ratio; Combinatorial optimization; Complexity theory; differential ratio; Approximate algorithms