Minimizing the density of terminal assignments in layout design

DOI10.1016/0167-6377(86)90083-0zbMath0626.90069OpenAlexW2155759941MaRDI QIDQ581242

Günter Rote, Franz Rendl

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90083-0

zbMATH Keywords

matchingsnetwork flowsassignmentdesign automationchannel routingconvex bipartite matchinglayout planningminimum density

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cites Work

• A linear-time algorithm for a special case of disjoint set union
• An assignment algorithm with applications to integrated circuit layout
• On the computational power of pushdown automata
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing the density of terminal assignments in layout design