.png){kind=icon}
返回
An approximation algorithm for computing longest paths
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00433-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We show that the color-coding method of Alon et al. [Journal of the ACM 42 (1995) 844], in its version specialized to compute simple paths of a specified cardinality k, can be extended both to approximate the maximum cardinality of the simple paths, when the source and the destination of the paths are given, and also to address the presence of arc lengths (the existence of the last extension was outlined by the authors for a more general color-coding algorithm, but it was not explicitly described, and its time complexity was not discussed). The extensions are then used to derive approximation results for the general longest path problem. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
heuristics
longest path
color-coding method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
分享收藏Small Molecule Binding to an Artificially Created Cavity at the Active Site of Cytochrome c Peroxidase.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏 没有更多内容
没有更多内容