New lower bounds for single row routing problems

Naveed A. Sherwani, Jitender S. Deogun

Research output: Contribution to conferencePaper

3 Citations (Scopus)

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
StatePublished - 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

Computational complexity

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, .

New lower bounds for single row routing problems. / Sherwani, Naveed A.; Deogun, Jitender S.

1990. 535-538 Paper presented at Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2), Champaign, IL, USA, .

Research output: Contribution to conferencePaper

Sherwani, NA & Deogun, JS 1990, 'New lower bounds for single row routing problems' Paper presented at Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2), Champaign, IL, USA, 8/14/89 - 8/16/89, pp. 535-538.
Sherwani NA, Deogun JS. New lower bounds for single row routing problems. 1990. Paper presented at Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2), Champaign, IL, USA, .
Sherwani, Naveed A. ; Deogun, Jitender S. / New lower bounds for single row routing problems. Paper presented at Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2), Champaign, IL, USA, .4 p.
@conference{8993c18d2f9a4a2ea62da1f682a436e3,
title = "New lower bounds for single row routing problems",
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.",
author = "Sherwani, {Naveed A.} and Deogun, {Jitender S.}",
year = "1990",
month = "12",
day = "1",
language = "English (US)",
pages = "535--538",
note = "Proceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2) ; Conference date: 14-08-1989 Through 16-08-1989",

}

TY - CONF

T1 - New lower bounds for single row routing problems

AU - Sherwani, Naveed A.

AU - Deogun, Jitender S.

PY - 1990/12/1

Y1 - 1990/12/1

N2 - 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.

AB - 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.

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

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

M3 - Paper

AN - SCOPUS:0025603599

SP - 535

EP - 538

ER -