• DocumentCode
    1177937
  • Title

    Use of Steiner´s problem in suboptimal routing in rectilinear metric

  • Author

    Lee, Jerry H. ; Bose, N.K. ; Hwang, Frank Kwangming

  • Volume
    23
  • Issue
    7
  • fYear
    1976
  • fDate
    7/1/1976 12:00:00 AM
  • Firstpage
    470
  • Lastpage
    476
  • Abstract
    Using known results in Steiner´s problem, suboptimal algorithms are advanced for routing single nets subject to the minimum length constraint and multinets subject to the minimum length and maximum allowable channel capacity constraints. Implementation of the algorithm on a large number of randomly generated examples indicates feasibility of fast CPU execution time and good quality of solution in comparison with other existing algorithms.
  • Keywords
    Graph theory and network topology; Integrated circuit layout; Layout; Layout, integrated circuits; Networks; Printed circuits; Channel capacity; Conducting materials; Conductors; Euclidean distance; Integrated circuit layout; Joining processes; Random number generation; Routing; Steiner trees; Wiring;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/TCS.1976.1084243
  • Filename
    1084243
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1177937