Combinatorics and Graph Theory


Vectored Route-Length Minimization - a Heuristic and an Open Conjecture

Authors: Florentin Smarandache, Sukanto Bhattacharya

We have posed a simple but interesting graph theoretic problem and posited a heuristic solution procedure, which we have christened as Vectored Route-length Minimization Search (VeRMinS). Basically, it constitutes of a re-casting of the classical "shortest route" problem within a strictly Euclidean space. We have only presented a heuristic solution process with the hope that a formal proof will eventually emerge as the problem receives wider exposure within mathematical circles.

Comments: 7 pages

Download: PDF

Submission history

[v1] 8 Mar 2010

Unique-IP document downloads: 144 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus