SMARANDACHE, FLORENTIN; BHATTACHARYA, SUKANTO - In: New Mathematics and Natural Computation (NMNC) 04 (2008) 03, pp. 267-272
We have posed a simple but interesting graph theoretic problem and posited a heuristic solution procedure, which we have christened as Vectored Route-lenght Minimization (VeRMin). Basically, it constitutes a re-casting of the classical "shortest route" problem in a strictly Euclidean space. We...