NNTP-Posting-Date: Tue, 01 Nov 2011 22:32:18 -0500 Newsgroups: comp.programming,comp.theory,sci.math,comp.graphics.algorithms Date: Tue, 1 Nov 2011 20:32:15 -0700 From: William Elliot Subject: Re: Worst Case Greedy Walk In-Reply-To: Message-ID: <20111101194849.B2462@agora.rdrop.com> References: <10a6051c-903f-4fd4-95e9-15e90dee066c@m19g2000yqh.googlegroups.com> <20111031205413.D47073@agora.rdrop.com> MIME-Version: 1.0 Content-Type: MULTIPART/MIXED; BOUNDARY="0-1963242490-1320202130=:2462" Content-ID: <20111101202651.H6935@agora.rdrop.com> Lines: 30 X-Usenet-Provider: http://www.giganews.com NNTP-Posting-Host: 199.26.172.34 X-AuthenticatedUsername: NoAuthUser X-Trace: sv3-ymk3BWS4Dbl2MC38gvBA9Iy7OtyB3vb/Xys6jTzUaIFr+XOz7O4v1575n4voBjvIgUmVRFYNHK4lnnv!7j+fEmTDTDjuAcmFHDjN7kI1N0c6mbafe7dbMgn8bCtpxiRsrChvu8NJqITY5xkEvuBGsgPPz2HI!0Rlox3E= X-Complaints-To: abuse@scnresearch.com X-DMCA-Complaints-To: abuse@scnresearch.com X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly X-Postfilter: 1.3.40 X-Original-Bytes: 2760 Path: csiph.com!x330-a1.tempe.blueboxinc.net!usenet.pasdenom.info!news.stben.net!border3.nntp.ams.giganews.com!border1.nntp.ams.giganews.com!border4.nntp.ams.giganews.com!border2.nntp.ams.giganews.com!feeder3.cambriumusenet.nl!feed.tweaknews.nl!209.197.12.246.MISMATCH!nx02.iad01.newshosting.com!newshosting.com!216.196.98.142.MISMATCH!border3.nntp.dca.giganews.com!border1.nntp.dca.giganews.com!nntp.giganews.com!local2.nntp.dca.giganews.com!nntp.scnresearch.com!news.scnresearch.com.POSTED!not-for-mail Xref: x330-a1.tempe.blueboxinc.net comp.programming:977 comp.theory:1298 comp.graphics.algorithms:559 This message is in MIME format. The first part should be readable text, while the remaining parts are likely unreadable without MIME-aware tools. --0-1963242490-1320202130=:2462 Content-Type: TEXT/PLAIN; CHARSET=X-UNKNOWN; FORMAT=flowed Content-Transfer-Encoding: 8BIT Content-ID: <20111101202651.E6935@agora.rdrop.com> On Tue, 1 Nov 2011, Andrew Tomazos wrote: > On Nov 1, 5:24 am, William Elliot wrote: >>> such that the total distance of the path traveled by starting at the >>> first point and moving directly to the nearest unvisited point (until >>> they have all been visited) is maximized >> >> That is ambiguous.  What if there is more than one "nearest" point? > > Ok, in that case the algorithm can choose. More formally make the set > of n points an n-tuple of points, and in the case of two or more > nearest unvisited points than the earlier one in the list is visited. You're clipping the essential problem statement which will sooner or later result in vague and useless replies. Please include essential content _within_ your reply. See http://oakroadsystems.com/genl/unice.htm When maximizing S(n) am I allowed both the choice of positions and of order? I'd think so, if I recall the problem correctly. --0-1963242490-1320202130=:2462--