Browse > Article
http://dx.doi.org/10.6109/jkiice.2014.18.8.1981

Density Minimization for the Assignment of P-color Points  

Kim, Jae-Hoon (Department of Computer Engineering, Busan University of Foreign Studies)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.18, no.8, 2014 , pp. 1981-1986 More about this Journal
Abstract
The problem studied in this paper is the channel routing problem to assign points with p colors on the upper row of the channel to points on the lower row in order to minimize its density. The case that the points on the upper row has an identical color or only two colors is studied in [1, 2]. This paper generalizes that to the points with p colors. First, we consider the problem to determine whether there is an assignment with density less than or equal to d, when an arbitrary d is given. We show that the problem is solved in O(p(n+m)log(n+m)) time. Using this result, we resolve the problem to fine an assignment with a minimum density.
Keywords
channel; channel routing; density; assignment; decision problem;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. S. Johnson, A. S. LaPaugh, and R. Y. Pinter, "Minimizing channel density by lateral shifting of components," in Proceeding of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 122-131, 1994.
2 M. J. Atallah and S. E. Hambrusch, "On terminal assignments that minimize the density," Purdue University, Technical Report CSD-TR-468, 1984.
3 M. J. Atallah and S. E. Hambrusch, "An assignment algorithm with applications to integrated circuit layout," Discrete Applied Mathematics, vol. 13, no. 1, pp. 9-22, 1986.   DOI
4 T. Yoshimura and E. S. Kuh, "Efficient algorithms for channel routing," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol. CAD-1, no. 1, January, pp. 25-35, 1982.
5 M. J. Atallah and S. E. Hambrusch, "Optimal rotation problems in channel routing," Purdue University, Technical Report CSD-TR-386, 1984.