Minimizing the density of terminal assignments in layout design
type: Item
instance of: scholarly article
title: Minimizing the density of terminal assignments in layout design
zbMATH Open document ID: 0626.90069
DOI: 10.1016/0167-6377(86)90083-0
author: Günter Rote
author: Franz Rendl
published in: Operations Research Letters
publication date: 1986-01-01T00:00:00Z
review text: The following problem is studied: each of n given entry terminals positioned at the upper row of a channel has to be assigned to one of m exit terminals positioned at the lower row in such a way that the resulting channel routing problem has minimum density. The authors construct an assignment with minimal density in O(m) time.
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 4018781
zbMATH Keywords: layout planning
zbMATH Keywords: design automation
zbMATH Keywords: matchings
zbMATH Keywords: convex bipartite matching
zbMATH Keywords: network flows
zbMATH Keywords: assignment
zbMATH Keywords: channel routing
zbMATH Keywords: minimum density
MaRDI profile type: Publication
full work available at URL: 0167-6377(86)90083-0
OpenAlex ID: W2155759941
cites work: On the computational power of pushdown automata
cites work: An assignment algorithm with applications to integrated circuit layout
cites work: Q3941433
cites work: Q3292914
cites work: A linear-time algorithm for a special case of disjoint set union
description: scientific article; zbMATH DE number 4018781