write that the longest path problem in unweighted undirected graphs "is notorious for the difficulty of understanding its approximation hardness" [REF].
In the case of unweighted but directed graphs, strong inapproximability results are known.