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 (VeRMin). Basically, it constitutes a re-casting of the classical “shortest route” problem in a strictly Euclidean space. We have presented only a heuristic solution process hoping that a formal proof will eventually emerge as the problem receives wider exposure within mathematical circles.
Field of Research
019999 Mathematical Sciences not elsewhere classified
Socio Economic Objective
970101 Expanding Knowledge in the Mathematical Sciences
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact firstname.lastname@example.org.