In this thesis, the multilayer layering problem of the single row routing is considered.
In each layer, intersteet crossing is not allowed.
We first deal with the layering problem of the two-node nets and extend to that of multi-node nets and show that these problems are reduced to the coloring problem of it's overlap graph.
We also present an heuristic algorithm for layering in the case of the restricted upper and lower street capacities.