Table of Contents
VLSI Design
Volume 2, Issue 2, Pages 117-129

An Effective Solution to the Linear Placement Problem

Computer Science Department, University of Missouri-Columbia, Mathematical Sciences Building, Columbia 65211, MO, USA

Copyright © 1994 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Citations to this Article [3 citations]

The following is the list of published articles that have cited the current article.

  • Y.G. Saab, “An improved linear placement algorithm using node compaction,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 15, no. 8, pp. 952–958, 1996. View at Publisher · View at Google Scholar
  • Sung-Woo Hur, and John Lillis, “Relaxation and clustering in a local search framework: Application to linear placement,” VLSI Design, vol. 14, no. 2, pp. 143–154, 2002. View at Publisher · View at Google Scholar
  • Phichet Wutthisirisart, James S. Noble, and C. Alec Chang, “A Two-Phased Heuristic for Relation-based Item Location,” Computers & Industrial Engineering, 2015. View at Publisher · View at Google Scholar