Incremental Processing Applied to Munkres’ Algorithm and Its Application in Steinberg’s Placement Procedure

DOI10.1137/0606019MaRDI QIDQ3687699zbMATHOpenAlexFDO

Authors H. W. Carter, Melvin A. Breuer, Zahir A. Syed

Publication date 1985

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0606019

zbMATH Keywords

layoutlinear assignmentincremental processingincremental Steinberg algorithmMunkres' algorithmplacement of modules

Mathematics Subject Classification ID

Algorithms in computer science (68W99) Theory of operating systems (68N25)

Recommendations

• Incremental assignment problem
• Improving the Hungarian assignment algorithm
• An addendum on the incremental assignment problem
• Linear placement algorithms and applications to VLSI design
• Incremental network optimization: theory and algorithms

Cites work

• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Algorithms for the Assignment and Transportation Problems
• An extension of the Munkres algorithm for the assignment problem to rectangular matrices
• The Backboard Wiring Problem: A Placement Algorithm

This page was built for publication: Incremental Processing Applied to Munkres’ Algorithm and Its Application in Steinberg’s Placement Procedure

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