This paper examines the application of the computationally powerful linear assignment algorithm to the placement problem. A brief description of the algorithm is given, followed by a discussion of its use with various problem constraints, for improving existing placements, and in a constructive-initial placement procedure. Several examples are included.
Many thanks to all of those contributors who provided information and references. If you nd errors or omissions, please send email to email@example.com. References 1] Sheldon B. Akers, Jr. Fault diagnosis as a graph coloring problem.