Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

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

FWIW:

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?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (8)
As of 2014-09-20 03:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (152 votes), past polls