An efficient algorithm approximately solving the General routing Problem in Graphs

Abstract

As to the General Connection Problem in Graphs we present an efficient constructive algorithm that tackles in a simultaneous manner both the placement $\vec \pi$ of the entities M with respect to constraints

and the routing $\vec \varphi _{\vec \pi }$ with respect to connection rule $\Omega \subseteq M^2 \times \tilde A \times \tilde N$ resulting to an approximate layout

with a time effort O(k²p·m (k² + log n))-such the solution grants an upper cost bound