Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re: Travelling problem

by LanX (Canon)
on Dec 22, 2013 at 05:14 UTC ( #1068085=note: print w/ replies, xml ) Need Help??

in reply to Travelling problem


The naive approach (start at first and successively take the shortest edge to a yet unvisited node) gives a path of length 95166.

Thats not bad considering that the lower bound for any possible solution is already at 70135! (summing up all minimal edges per node and striking the longest of those edges again)

NB: This doesn't mean that such a solution exists, thats fairly utopic.

Cheers Rolf

( addicted to the Perl Programming Language)

Comment on Re: Travelling problem

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1068085]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (4)
As of 2015-10-10 09:13 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (255 votes), past polls