An approximation algorithm for computing longest paths

European Journal of Operational Research

Volumn 148, Issue 3, 2003, Pages 584-590

  Scutellà, Maria Grazia ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Color coding method; Heuristics; Longest path

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; HEURISTIC METHODS; OPTIMIZATION; POLYNOMIALS;

COLOR-CODING METHOD;

OPERATIONS RESEARCH;

EID: 0037411883     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00433-2     Document Type: Article

References (7)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows: Theory, algorithms and applications. 1993;Prentice Hall, New Jersey.
2. Alon N., Yuster R., Zwick U. Color-coding. Journal of the ACM. 42(4):1995;844-856.
3. Garey M.R., Johnson D.S. Strong NP-completeness results: Motivation, examples and implications. Journal of the Association of Computing Machinery. 25:1978;499-508.
4. Karger D., Motwani R., Ramkumar G.D.S. On approximating the longest path in a graph. Algorithmica. 18:1997;82-98.
5. Karp R.M. A characterization of the minimum cycle mean in a diagraph. Discrete Mathematics. 23:1978;309-311.
6. Robertson N., Seymour P. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms. 7:1986;309-322.
7. Schmidt J.P., Siegel A. The spatial complexity of oblivious k-probe hash functions. Siam Journal on Computing. 19(5):1990;775-786.