1
$\begingroup$

I have found dynamic solution for Bitonic tour but I could not find any greedy approach for this problem. Is it possible to solve it in a greedy manner?

$\endgroup$
  • 1
    $\begingroup$ Wikipedia doesn't mention one, but does mention dynamic programming. $\endgroup$ – Yuval Filmus Apr 3 '18 at 12:27
  • $\begingroup$ Do you have any ideas on how you could possibly solve it in a greedy manner? $\endgroup$ – nbro Apr 3 '18 at 14:13

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.