.png){kind=icon}
.png){kind=icon}
Return
An approximation algorithm for computing longest paths
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00433-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
heuristics
longest path
color-coding method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available