Unconstrained multilayer switchbox routing

Unconstrained multilayer switchbox routing

0.00 Avg rating0 Votes
Article ID: iaor1996160
Country: Switzerland
Volume: 58
Issue: 1
Start Page Number: 481
End Page Number: 491
Publication Date: Jul 1995
Journal: Annals of Operations Research
Authors: , ,
Keywords: networks: scheduling
Abstract:

Consider the gradually more and more complex problems of single row routing, channel routing and switchbox routing on the one hand, and the gradually less and less restrictive models (1-layer, Manhattan, unconstrained 2-layer, multilayer) on the other hand. The single row routing problems can always be solved in the Manhattan model, and the channel routing problem can always be solved in the unconstrained 2-layer model, in fact, both in linear time. In this paper, the authors show that the switchbox routing problem is solvable in the multilayer model, also in linear time.

Reviews

Required fields are marked *. Your email address will not be published.