Absolute Area Approximation in Channel Routing is NP-Hard

Authors

  • Rajat Kumar Pal Department of Computer Science and Engineering, University of Calcutta, 92, A. P. C. Road, Kolkata 700 009, India

DOI:

https://doi.org/10.26713/jims.v1i2%20&%203.16

Keywords:

Absolute approximation, Area minimization, Channel routing problem, NP-hardness, Doglegging, Reserved layer model, Manhattan routing

Abstract

The computational complexity of minimizing area of routing in two-and three-layer channels is known to be NP-hard [9,13]. In this paper we establish the result of computing an absolute approximate solution for no-dogleg two-layer \emph{VH} channel routing is NP-hard. This result holds for channels with only two-terminal nets, where we impose a restriction of a partition of nets, such that the nets of the same class in the partition are to be assigned to the same track in any routing solution. We have proved the NP-hardness of the absolute area approximation problem for channels with nets having a bounded number of terminals per net. The later results have also been extended for routing using restricted doglegging. All the problems considered above for the two-layer \emph{VH} routing model remain NP-hard even in the three-layer \emph{HVH} routing model.

Downloads

Download data is not yet available.

Downloads

CITATION

How to Cite

Pal, R. K. (2009). Absolute Area Approximation in Channel Routing is NP-Hard. Journal of Informatics and Mathematical Sciences, 1(2 & 3), 121–137. https://doi.org/10.26713/jims.v1i2 & 3.16

Issue

Vol. 1 No. 2 & 3 (2009)

Section

Research Articles

License

Authors who publish with this journal agree to the following terms:
  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.