Back to Search
Start Over
Unconstrained multilayer switchbox routing.
- Source :
- Annals of Operations Research; 1995, Vol. 58 Issue 1-4, p481-491, 11p
- Publication Year :
- 1995
-
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, we show that the switchbox routing problem is solvable in the multilayer model, also in linear time. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02545330
- Volume :
- 58
- Issue :
- 1-4
- Database :
- Complementary Index
- Journal :
- Annals of Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 18651763
- Full Text :
- https://doi.org/10.1007/BF02057159