### Abstract

A novel approach to the classical single-row routing problem is presented. The approach is based on a graph-theoretic representation, in which an instance of the single row routing problem is represented by three graphs, a circle graph, a permutation graph, and an interval graph. Three schemes for decomposition of the problem are presented. The decomposition process is applied recursively until either each subproblem is nondecomposable or it belongs to one of the special classes of single row routing problem. For some special classes, it is shown that routing can be done optimally, while solution in other cases can be approximated using heuristic algorithms. These solutions of subproblems are then combined to obtain the solution of the given problem.

Original language | English (US) |
---|---|

Title of host publication | Proceedings - IEEE International Symposium on Circuits and Systems |

Publisher | Publ by IEEE |

Pages | 1437-1440 |

Number of pages | 4 |

ISBN (Print) | 9517212402 |

State | Published - Dec 1 1988 |

### Publication series

Name | Proceedings - IEEE International Symposium on Circuits and Systems |
---|---|

Volume | 2 |

ISSN (Print) | 0271-4310 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Electronic, Optical and Magnetic Materials

### Cite this

*Proceedings - IEEE International Symposium on Circuits and Systems*(pp. 1437-1440). (Proceedings - IEEE International Symposium on Circuits and Systems; Vol. 2). Publ by IEEE.

**Graph theoretic approach to single row routing problems.** / Bhattacharya, Bhargab B.; Deogun, Jitender S; Sherwani, Naveed A.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings - IEEE International Symposium on Circuits and Systems.*Proceedings - IEEE International Symposium on Circuits and Systems, vol. 2, Publ by IEEE, pp. 1437-1440.

}

TY - GEN

T1 - Graph theoretic approach to single row routing problems

AU - Bhattacharya, Bhargab B.

AU - Deogun, Jitender S

AU - Sherwani, Naveed A.

PY - 1988/12/1

Y1 - 1988/12/1

N2 - A novel approach to the classical single-row routing problem is presented. The approach is based on a graph-theoretic representation, in which an instance of the single row routing problem is represented by three graphs, a circle graph, a permutation graph, and an interval graph. Three schemes for decomposition of the problem are presented. The decomposition process is applied recursively until either each subproblem is nondecomposable or it belongs to one of the special classes of single row routing problem. For some special classes, it is shown that routing can be done optimally, while solution in other cases can be approximated using heuristic algorithms. These solutions of subproblems are then combined to obtain the solution of the given problem.

AB - A novel approach to the classical single-row routing problem is presented. The approach is based on a graph-theoretic representation, in which an instance of the single row routing problem is represented by three graphs, a circle graph, a permutation graph, and an interval graph. Three schemes for decomposition of the problem are presented. The decomposition process is applied recursively until either each subproblem is nondecomposable or it belongs to one of the special classes of single row routing problem. For some special classes, it is shown that routing can be done optimally, while solution in other cases can be approximated using heuristic algorithms. These solutions of subproblems are then combined to obtain the solution of the given problem.

UR - http://www.scopus.com/inward/record.url?scp=0024124297&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024124297&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9517212402

T3 - Proceedings - IEEE International Symposium on Circuits and Systems

SP - 1437

EP - 1440

BT - Proceedings - IEEE International Symposium on Circuits and Systems

PB - Publ by IEEE

ER -