Single-layer fanout routing and routability analysis for Ball Grid Arrays
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
A Faster Algorithm for Finding Disjoint Paths in Grids
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Layer minimization of escape routing in area array packaging
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Optimal bus sequencing for escape routing in dense PCBs
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Ordered escape routing based on Boolean satisfiability
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Automatic bus planner for dense PCBs
Proceedings of the 46th Annual Design Automation Conference
A correct network flow model for escape routing
Proceedings of the 46th Annual Design Automation Conference
Optimal layer assignment for escape routing of buses
Proceedings of the 2009 International Conference on Computer-Aided Design
A Network-Flow-Based RDL Routing Algorithmz for Flip-Chip Design
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A provably good approximation algorithm for rectangle escape problem with application to PCB routing
Proceedings of the 16th Asia and South Pacific Design Automation Conference
An optimal algorithm for layer assignment of bus escape routing on PCBs
Proceedings of the 48th Design Automation Conference
Recent research development in PCB layout
Proceedings of the International Conference on Computer-Aided Design
Density-reduction-oriented layer assignment for rectangle escape routing
Proceedings of the great lakes symposium on VLSI
| Hi-index | 0.00 |
The maximum disjoint subset (MDS) of rectangles is a subset of non-overlapping rectangles with the maximum total weight. The problem of finding the MDS of general rectangles has been proven to be NP-complete in [6]. In this paper, we focus on the problem of finding the MDS of boundary rectangles, which is an open problem and is closely related to some difficult problems in PCB routing. We propose a polynomial time algorithm to optimally solve the MDS problem of boundary rectangles. Then we show that this algorithm can be applied to find the optimal solution of the bus escape routing problem.