Loading...

The maximum disjoint routing problem

Shahmohammadi, F ; Sharif University of Technology | 2016

501 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-319-42634-1_26
  3. Publisher: Springer Verlag , 2016
  4. Abstract:
  5. Motivated by the bus escape routing problem in printed circuit boards, we revisit the following problem: given a set of n axis-parallel rectangles inside a rectangular region R, find the maximum number of rectangles that can be extended toward the boundary of R, without overlapping each other. We provide an efficient algorithm for solving this problem in O(n2 log3 n log log n) time, improving over the current best O(n3)-time algorithm available for the problem
  6. Keywords:
  7. Algorithms ; Combinatorial mathematics ; Printed circuit boards ; Printed circuits ; Algorithm for solving ; Axis parallel rectangles ; Escape routing ; Following problem ; Rectangular regions ; Routing problems ; Time algorithms ; Problem solving
  8. Source: 22nd International Conference on Computing and Combinatorics, COCOON 2016, 2 August 2016 through 4 August 2016 ; Volume 9797 , 2016 , Pages 319-329 ; 03029743 (ISSN); 9783319426334 (ISBN)
  9. URL: http://link.springer.com/chapter/10.1007/978-3-319-42634-1_26