Minimizing the density of terminal assignments in layout design (Q581242)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimizing the density of terminal assignments in layout design |
scientific article; zbMATH DE number 4018781
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the density of terminal assignments in layout design |
scientific article; zbMATH DE number 4018781 |
Statements
Minimizing the density of terminal assignments in layout design (English)
0 references
1986
0 references
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.
0 references
layout planning
0 references
design automation
0 references
matchings
0 references
convex bipartite matching
0 references
network flows
0 references
assignment
0 references
channel routing
0 references
minimum density
0 references
