New lower bounds for single row routing problems

Naveed A. Sherwani, Jitender S. Deogun

Research output: Contribution to conferencePaper

3 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages535-538
Number of pages4
Publication statusPublished - Dec 1 1990
EventProceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2) - Champaign, IL, USA
Duration: Aug 14 1989Aug 16 1989

Other

OtherProceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2)
CityChampaign, IL, USA
Period8/14/898/16/89

    Fingerprint

ASJC Scopus subject areas

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

Cite this

Sherwani, N. A., & Deogun, J. S. (1990). New lower bounds for single row routing problems. 535-538. Paper presented at Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2), Champaign, IL, USA, .