Minimizing the density of terminal assignments in layout design

Authors:
Günter Rote;Franz Rendl
Affiliations:
Institut für Mathematik, Technische Universität Graz, Kopernikusgasse 24, A-8010 Graz, Austria;Institut für Mathematik, Technische Universität Graz, Kopernikusgasse 24, A-8010 Graz, Austria
Venue:
Operations Research Letters
Year:
1986

Citing 3
Cited 0

The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
A linear-time algorithm for a special case of disjoint set union

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Three layers are enough

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a linear-time solution to the problem of assigning each of n given entry terminals positioned at the upper row of a channel to one of m given exit terminals positioned at the lower row, so as to minimize the density of the resulting channel routine problem.