Skip Navigation

The Computer Journal 1971 14(3):260-262; doi:10.1093/comjnl/14.3.260
© 1971 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by LoDato, V. A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The minimisation of distance in placement algorithms

V. A. LoDato *

Simulating Science and Engineering, 3 Daisy Lane, Wappinger Falls, New York, USA

The criterion of total length in placement algorithms is examined by means of statistical inferences. It is shown that it is a poor global constraint and appears to be a good local constraint. This is verified by coupling a partitioning and placement algorithm and comparing it to a placement algorithm using total length as its only constraint.

Received February 1970.

* Simulating Science and Engineering, 3 Daisy Lane, Wappinger Falls, N.Y., USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.