Loading...

Bus Routing on Printed Circuit Boards

Ahmadinejad, Amir Mahdi | 2014

693 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 46728 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Zarrabi Zadeh, Hamid
  7. Abstract:
  8. recent years, by the huge increase in the number of components on a board, the bus routing problem and minimizing the number of layers of a board has emerged as a significant challenge in designing Printed Circuit Boards (PCBs). Two related theoretical problems to bus routing are the Rectangle Escape Problem (REP) and the maximum independent set of rectangles problem where both of these problems are NP-hard in the general form. In this thesis we study some variants of these problems and try to improve the running time or approximation factor of the best algorithms previously provided for solving them. The maximum disjoint set of boundary rectangles problem is a variant of the maximum independent set of rectangles problem where each rectangle is attached to the interior boundary of a rectangular region. This problem is mostly related to bus routing problem. We provide an O(n4)-time algorithm for the maximum disjoint set of boundary rectangles problem, improving upon the best previous O(n6)-time algorithm. We also define the 2-sided rectangle escape problem which is a variant of REP. We show that this problem is still NP-hard and there exist a 2-approximation algorithm for this problem
  9. Keywords:
  10. Approximate Algorithm ; Algorithms Design ; Maximum Disjoint Set Boundary Rectangles ; Bus Routing ; Maximum Independent Set of Rectangles ; Rectangle Escape Problem

 Digital Object List