We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Walking the Approximate Longest Path
Walking the Approximate Longest Path
Sort by
recency
|
16 Discussions
|
Please Login in order to post a comment
Here is problem solution in Python Java c++ and c programming - https://programs.programmingoneonone.com/2021/07/hackerrank-walking-the-approximate-longest-path-problem-solution.html
sttill now i dont solve it 100%. so if one complete it so let me inform me . and please explain the map are given in the question.
How is this an NP Complete question? Can it be solved in polynomial time complexity? Can it be reduced to any other NP Hard problem?
i am unabling to understand the question properly.. please eleborate this
The problem statement doesn't make sense:
This makes no sense because p[i] is a PERMUTATION. It's a series of cities including all cities exactly once. You can't have an edge between two permutations.
Perhaps the intended meaning was this:
The term "approximate" is used because a solution will be accepted if it's close (at least 80% of n).