.png){kind=icon}
返回
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2003.09.007.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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 bnly one endpoint is specified. We show that HPPs,t is 1/2-differential approximable and HPPs is 2/3-differential approximable. Moreover, we observe that these problems cannot be differential approximable better than 741/742. Based, upon these results, we obtain new bounds for standard ratio: a 1/2-standard approximation for M-A x HPPs,t and a 2/3 for M-A x HPPs, which can be improved to 2/3 for M-A x HPPs,t [a,2a] (all the edge weights are within an interval [a, 2a]), to 5/6 for M-A x HPPs [a, 2a] and to 2/3 for M-IN HPPs,t [a, 2a], to 3/4 for M-IN HPPs [a, 2a]. (C) 2003 Elsevier B.V. All rights reserved.
Keyword:
approximate algorithms
differential ratio
complexity theory
combinatorial optimization
performance ratio
analysis of algorithms
Hamiltonian paths
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
分享收藏Predictive risk stratification model: a progressive cluster-randomised trial in chronic conditions management (PRISMATIC) research protocol.png)
TrialsOAAI
TrialsIF0
OAAI分享收藏
查看更多内容