An assignment algorithm with applications to integrated circuit layout

DOI10.1016/0166-218X(86)90064-8zbMATH Open0583.90066MaRDI QIDQ1069442FDOQ1069442

Mikhail J. Atallah, Susanne E. Hambrusch

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationdata structuresoptimal solutionminimum density2- terminal one-to-any problem2-color one-to-any problemchannel routing problemdesign of layout systemsterminal assignments

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Optimal Wiring of Movable Terminals
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• An algorithm for assigning multiplexer inputs
• Title not available (Why is that?)
• Minimizing the density of terminal assignments in layout design

Recommendations

• A framework for solving VLSI graph layout problems 👍 👎
• Algorithms for assignment problems on an array processor 👍 👎
• A graph-theoretic approach to the IC layout resizing problem 👍 👎
• Linear placement algorithms and applications to VLSI design 👍 👎
• An algorithm for the assignment problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: An assignment algorithm with applications to integrated circuit layout

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069442)