The Maximum Disjoint Routing Problem
COMPUTING AND COMBINATORICS, COCOON 2016(2016)
摘要
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(n(2) log(3) n log log n) time, improving over the current best O(n(3))-time algorithm available for the problem.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络