• DocumentCode
    1144381
  • Title

    Further Comments on "An Optimal Solution for the Channel- Assignment Problem"

  • Author

    Rubin, Frank

  • Author_Institution
    IBM
  • Issue
    6
  • fYear
    1981
  • fDate
    6/1/1981 12:00:00 AM
  • Firstpage
    455
  • Lastpage
    455
  • Abstract
    In the above paper1Gupta, Lee, and Leung present a new algorithm for making an optimal assignment of wire segments to channels on a PC board. The new algorithm has a running time of 0(N log N) in the general case, but can be executed in 0(N) time if the wire segment endpoints are close to uniformly distributed.
  • Keywords
    Apertures; Automation; Conferences; Notice of Violation; Organizing; Partitioning algorithms; Routing; Wire;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1981.1675817
  • Filename
    1675817
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1144381