An optimal algorithm for finding disjoint rectangles and its application to PCB routing

Hui Kong, Qiang Ma, Tan Yan, Martin D.F. Wong

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationProceedings of the 47th Design Automation Conference, DAC '10
Number of pages6
StatePublished - 2010
Event47th Design Automation Conference, DAC '10 - Anaheim, CA, United States
Duration: Jun 13 2010Jun 18 2010

Publication series

NameProceedings - Design Automation Conference
ISSN (Print)0738-100X


Other47th Design Automation Conference, DAC '10
Country/TerritoryUnited States
CityAnaheim, CA


  • Escape routing
  • Maximum independent subset
  • PCB routing

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Modeling and Simulation


Dive into the research topics of 'An optimal algorithm for finding disjoint rectangles and its application to PCB routing'. Together they form a unique fingerprint.

Cite this