[1] viXra:1004.0018 [pdf] submitted on 8 Mar 2010
Authors: Florentin Smarandache, Sukanto Bhattacharya
Comments: 7 pages
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.
Category: Combinatorics and Graph Theory