Loading...

Finding maximum disjoint set of boundary rectangles with application to PCB routing

Ahmadinejad, A ; Sharif University of Technology

578 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/TCAD.2016.2585761
  3. Abstract:
  4. Motivated by the bus escape routing problem in printed circuit boards (PCBs), we study the following optimization problem: given a set of rectangles attached to the boundary of a rectangular region, find a subset of nonoverlapping rectangles with maximum total weight. We present an efficient algorithm that solves this problem optimally in O(n4) time, where n is the number of rectangles in the input instance. This improves over the best previous O(n6) -time algorithm available for the problem. We also present two efficient approximation algorithms for the problem that find near-optimal solutions with guaranteed approximation factors. The first algorithm finds a 2-approximate solution in O(n2) time, and the second one computes a 4/3 -approximation in O(n3) time. The experimental results demonstrate the efficiency of both our exact and approximation algorithms. © 1982-2012 IEEE
  5. Keywords:
  6. Approximation algorithm ; Maximum independent set (MIS) ; Printed circuit board (PCB) routing ; Geometry ; Optimization ; Printed circuit boards ; Approximation factor ; Efficient approximation algorithms ; Escape routing ; Maximum independent sets ; Near-optimal solutions ; Optimization problems ; Printed circuit board (PCBs) ; Printed circuit boards (PCB) ; Approximation algorithms
  7. Source: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems ; Volume 36, Issue 3 , 2017 , Pages 412-420 ; 02780070 (ISSN)
  8. URL: https://ieeexplore.ieee.org/document/7501613