New lower bounds for single row routing problems

New lower bounds for single-row routing problems are presented. The new lower bounds are based on a graph-theoretic representation in which an instance of the single-row routing problem is represented by three graphs, an overlap graph, a containment graph, and an interval graph. These bounds improve the best known existing bounds. Lower bounds are important for saving computational effort in routing since the single-row routing problem is NP-complete.<<ETX>>

[1]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[2]  David Hung-Chang Du,et al.  Heuristic Algorithms for Single Row Routing , 1987, IEEE Transactions on Computers.

[3]  Sartaj Sahni,et al.  Single Row Routing , 1983, IEEE Transactions on Computers.

[4]  Sartaj Sahni,et al.  The complexity of single row routing , 1984 .

[5]  Sartaj Sahni,et al.  Single-Row Routing in Narrow Streets , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  E. Kuh,et al.  The multilayer routing problem: Algorithms and necessary and sufficient conditions for the single-row, single-layer case , 1976 .

[7]  Oscar H. Ibarra,et al.  Single-Row Routing with Crossover Bound , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[8]  Ernest S. Kuh,et al.  On optimum single row routing , 1979 .

[9]  Frank Harary,et al.  Graph Theory , 2016 .

[10]  Jitender S. Deogun,et al.  A graph theoretic approach to single row routing problems , 1988, 1988., IEEE International Symposium on Circuits and Systems.