An approximation algorithm for computing longest paths.
type: Item
instance of: scholarly article
title: An approximation algorithm for computing longest paths.
zbMATH Open document ID: 1035.90075
DOI: 10.1016/S0377-2217(02)00433-2
author: Maria Grazia Scutellà
published in: European Journal of Operational Research
publication date: 2003-06-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1930171
zbMATH Keywords: Heuristics
zbMATH Keywords: Longest path
zbMATH Keywords: Color-coding method
MaRDI profile type: Publication
cites work: Q3056948
cites work: Color-coding
cites work: `` Strong '' NP-Completeness Results
cites work: On approximating the longest path in a graph
cites work: A characterization of the minimum cycle mean in a digraph
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: The Spatial Complexity of Oblivious k-Probe Hash Functions
full work available at URL: s0377-2217(02)00433-2
OpenAlex ID: W2064110920
description: scientific article; zbMATH DE number 1930171