• DocumentCode
    940359
  • Title

    Ordering the data for Lee´s algorithm

  • Author

    Moran, P.L. ; Price, I.R.

  • Author_Institution
    Loughborough University of Technology, Deparment of Electronic & Electrical Engineering, Loughborough, UK
  • Volume
    12
  • Issue
    23
  • fYear
    1976
  • Firstpage
    617
  • Lastpage
    618
  • Abstract
    It is shown that, when using Lee´s algorithm for interconnection programs, if the order in which the tracks are routed is determined by the distance between the start and end points of each tracks, on average more paths may be placed than if the order is chosen at random.
  • Keywords
    circuit layout CAD; Lee´s algorithm for interconnection programs; ordering routing based on routing length;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19760471
  • Filename
    4240227
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=940359