Optimal algorithms for restricted single row routing problems
Moinul Hossain, Naveed A. Sherwani, Jitender S. Deogun · 2002
Some restricted single-row routing problem are considered. A graph-theoretic approach is used to obtain restricted classes of single-row routing problems. Optimal street congestion algorithms are proposed for single-row routing problems that have overlap graphs isomorphic to path, binary tree, and clique.>