Abstract
We describe and solve two problems motivated from routing in CMOS cells layed out in the style of one-dimensional transistor arrays, as well as from channel routing. In the first problem we find an optimal subset of intervals to be layed out on k tracks, for any given k. In the second problem we find an optimal set of nested intervals, to be layed out on any given number of tracks. Both solutions are polynomial time, and have applications in many routing problems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Aharoni, I.B-A. Hartman, and A.J. Hoffman, Path Partitions and Packs of Acyclic Digraphs, Pacific Journal of Mathematics, 118(2) (1985), 249–259.
R. Bar-Yehuda, J.A. Feldman, R.Y. Pinter, and S. Wimer, Depth First Search and Dynamic Programming Algorithms for Efficient CMOS Cell Generation IEEE Trans. on CAD, 8(7), (1989), 737–743.
J.A. Bondy and U.S.R. Murty, Graph Theory with Applications Macmillan, London, and American Elsevier, New York 1976.
H. Edelsbrunner, M. Overmars, and E. Welzl, I.B-A. Hartman, and J.A. Feldman, Ranking Intervals Under Visibility Constraints, Intern. J.Computer Math. 34, (1990), 129–144.
S. Even, Graph Algorithms, Computer Science Press, 1979.
J.C. Fournier, Une Characterization des graphes de cordes, C.R.Acad.Sci.Paris 286A, (1978), 811–813.
F. Gavril, Algorithms for a maximum clique and a minimum independent set of a circle graph, Networks 3, (1973), 261–273.
M.C.Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.
A.Hashimoto and J.Stevens, Wire Routing by Optimizing Channel Assignment, Proc. 8th DA Conference, (1971), 214–224.
A.J. Hoffman, Extending Greene's Theorem to Directed Graphs, J. Combinatorial Theory, Ser.A, 34 (1983), 102–107.
A.J. Hoffman and J.B. Kruskal, Integral boundary points of convex polyhedra, in Linear inequalities and related systems, Annals of Mathematics Study 8, (1956), 223–246.
L.G. Khachian, A Polynomial algorithm for linear programming, Doclady Akad. Nauk USSR, 244, no.5 7 (1979), 1093–96.
A.S.LaPaugh and R.Y.Pinter, Channel Routing for Integrated Circuits, Annual Review of Computer Science 4, (1989).
L. Redei, Ein Kombinatorischer Satz, Acta Litt. Sci. Szeged 7 (1934), 39–43.
T.G. Szymanski, Dogleg Channel Routing is NP-Completc, IEEE Trans. on Computer-Aided Design CAD-4, (Jan. 1985), 31–41.
T. Uehara and W. M. vanCleemput, Optimal Layout of CMOS Functional Arrays, IEEE Trans. on Comput., C-30, (1981), 305–312.
S. Wimer, R. Y. Pinter, and J. A. Feldman, Optimal Chaining of CMOS Transistors in a Functional Cell, IEEE Trans. on CAD of Integrated Circuits and Systems, CAD-6, (1987), 795–801.
U. Yoeli, A Robust Channel Router, IEEE Trans. on Computer-Aided Design CAD-10(2), (February 1991), 212–219.
T.Yoshimura, An Efficient Channel Router, Proc. 21st Design Automation Conference, (June 1984), 38–44.
T. Yoshimura and E.S. Kuh, Efficient Algorithms for Channel Routing, IEEE Trans. on Computer-Aided Design, CAD-1(1), (Jan. 1982), 25–35.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hartman, I.BA. (1992). Optimal k-colouring and k-nesting of intervals. In: Dolev, D., Galil, Z., Rodeh, M. (eds) Theory of Computing and Systems. ISTCS 1992. Lecture Notes in Computer Science, vol 601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035179
Download citation
DOI: https://doi.org/10.1007/BFb0035179
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55553-7
Online ISBN: 978-3-540-47214-8
eBook Packages: Springer Book Archive