Bus Routing on Printed Circuit Boards, M.Sc. Thesis Sharif University of Technology ; Zarrabi Zadeh, Hamid (Supervisor)
Abstract
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...
Cataloging briefBus Routing on Printed Circuit Boards, M.Sc. Thesis Sharif University of Technology ; Zarrabi Zadeh, Hamid (Supervisor)
Abstract
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...
Find in contentBookmark |
|