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

DOI10.1137/0606019zbMATH Open0571.68017OpenAlexW2050355364MaRDI QIDQ3687699FDOQ3687699

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

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

zbMATH Keywords

layoutlinear assignmentincremental processingincremental Steinberg algorithmMunkres' algorithmplacement of modules

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Algorithms for the Assignment and Transportation Problems
• The Backboard Wiring Problem: A Placement Algorithm
• An extension of the Munkres algorithm for the assignment problem to rectangular matrices

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)