On the Performance of a Simple Approximation Algorithm for the Longest Path Problem
2019 ◽
Vol 35
(1)
◽
pp. 57-68
Keyword(s):
The longest path problem is known to be NP-hard. Moreover, they cannot be approximated within a constant ratio, unless ${\rm P=NP}$. The best known polynomial time approximation algorithms for this problem essentially find a path of length that is the logarithm of the optimum.In this paper we investigate the performance of an approximation algorithm for this problem in almost every case. We show that a simple algorithm, based on depth-first search, finds on almost every undirected graph $G=(V,E)$ a path of length more than $|V|-3\sqrt{|V| \log |V|}$ and so has performance ratio less than $1+4\sqrt{\log |V|/|V|}$.\
2011 ◽
Vol 474-476
◽
pp. 924-927
◽
2002 ◽
Vol 13
(04)
◽
pp. 613-627
◽
2013 ◽
pp. 132-143
1993 ◽
Vol 18
(2)
◽
pp. 334-345
◽
2018 ◽
Vol 63
(9)
◽
pp. 3151-3158
◽
2013 ◽
Vol 23
(06)
◽
pp. 461-477
◽
2016 ◽
Vol 33
(3)
◽
pp. 809-813
◽