Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I’m looking for an approximation algorithm for the following problem – I have an unweighted, undirected graph, with cycles, and want to find the longest path starting from a given node.
I do value speed over performance (so a O(n^5) algorithm would probably be an overkill).
This is not homework (I swear!) or work related, but I will appreciate any tip you might have.
Scientists are looking for it as well. They have also proved that polynomial constant-factor approximation doesn’t exist if P ≠ NP. And the abstract of this article claims that it contains an approximation algorithm for your problem.