An efficient algorithm approximately solving the General routing Problem in Graphs

  • Peter Richter
Poster Abstracts
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1226)


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(k2p·m (k2 + log n))-such the solution grants an upper cost bound

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Peter Richter
    • 1
  1. 1.Institute for InformaticsPotsdam UniversityPotsdamGermany

Personalised recommendations