• DocumentCode
    911201
  • Title

    On VHV-routing in channels with irregular boundaries

  • Author

    Vijayan, Gopalakriskhnan ; Chen, Howard H. ; Wong, C.K.

  • Author_Institution
    IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
  • Volume
    8
  • Issue
    2
  • fYear
    1989
  • fDate
    2/1/1989 12:00:00 AM
  • Firstpage
    146
  • Lastpage
    152
  • Abstract
    A description is given of the VHV-channel-routing problem in irregular channels. The authors describe a branch-and-bound algorithm for finding optimal solutions for this problem. The algorithm partitions the channels into boxes and searches for the optimal among the various mappings of the horizontal net segments to the boxes. The authors discuss three different branching strategies for the algorithm. Heuristic algorithms based on the branching strategies are also discussed. It is also shown that VHV routing is NP-hard for irregular channels
  • Keywords
    circuit layout; optimisation; NP-hard; VHV-routing; branch-and-bound algorithm; branching strategies; horizontal net segments; irregular boundaries; mappings; Cities and towns; Heuristic algorithms; Partitioning algorithms; Pins; Polynomials; Routing; Shape; Wire;
  • fLanguage
    English
  • Journal_Title
    Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0278-0070
  • Type

    jour

  • DOI
    10.1109/43.21833
  • Filename
    21833
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=911201