Optimal algorithms for restricted single row routing problems

Moazzem Hossain; Naveed A. Sherwani; Jitender Deogun

doi:10.1109/MWSCAS.1991.252086

Optimal algorithms for restricted single row routing problems

Moazzem Hossain, Naveed A. Sherwani, Jitender Deogun

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

2 Scopus citations

Abstract

In this paper, we consider some restricted single row routing problems. 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, clique.

Original language	English (US)
Title of host publication	1991 Proceedings of the 34th Midwest Symposium on Circuits and Systems, MWSCAS 1991
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	823-826
Number of pages	4
ISBN (Electronic)	0780306201
DOIs	https://doi.org/10.1109/MWSCAS.1991.252086
State	Published - 1991
Externally published	Yes
Event	34th Midwest Symposium on Circuits and Systems, MWSCAS 1991 - Monterey, United States Duration: May 14 1992 → May 17 1992

Publication series

Name	Midwest Symposium on Circuits and Systems
ISSN (Print)	1548-3746

Conference

Conference	34th Midwest Symposium on Circuits and Systems, MWSCAS 1991
Country/Territory	United States
City	Monterey
Period	5/14/92 → 5/17/92

ASJC Scopus subject areas

Electronic, Optical and Magnetic Materials
Electrical and Electronic Engineering

Access to Document

10.1109/MWSCAS.1991.252086

Cite this

Hossain, M., Sherwani, N. A., & Deogun, J. (1991). Optimal algorithms for restricted single row routing problems. In 1991 Proceedings of the 34th Midwest Symposium on Circuits and Systems, MWSCAS 1991 (pp. 823-826). Article 252086 (Midwest Symposium on Circuits and Systems). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/MWSCAS.1991.252086

Optimal algorithms for restricted single row routing problems. / Hossain, Moazzem; Sherwani, Naveed A.; Deogun, Jitender.
1991 Proceedings of the 34th Midwest Symposium on Circuits and Systems, MWSCAS 1991. Institute of Electrical and Electronics Engineers Inc., 1991. p. 823-826 252086 (Midwest Symposium on Circuits and Systems).

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

Hossain, M, Sherwani, NA & Deogun, J 1991, Optimal algorithms for restricted single row routing problems. in 1991 Proceedings of the 34th Midwest Symposium on Circuits and Systems, MWSCAS 1991., 252086, Midwest Symposium on Circuits and Systems, Institute of Electrical and Electronics Engineers Inc., pp. 823-826, 34th Midwest Symposium on Circuits and Systems, MWSCAS 1991, Monterey, United States, 5/14/92. https://doi.org/10.1109/MWSCAS.1991.252086

@inproceedings{440221bbc0324e0c9cbdcf103943620a,

title = "Optimal algorithms for restricted single row routing problems",

abstract = "In this paper, we consider some restricted single row routing problems. 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, clique.",

author = "Moazzem Hossain and Sherwani, {Naveed A.} and Jitender Deogun",

note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 34th Midwest Symposium on Circuits and Systems, MWSCAS 1991 ; Conference date: 14-05-1992 Through 17-05-1992",

year = "1991",

doi = "10.1109/MWSCAS.1991.252086",

language = "English (US)",

series = "Midwest Symposium on Circuits and Systems",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "823--826",

booktitle = "1991 Proceedings of the 34th Midwest Symposium on Circuits and Systems, MWSCAS 1991",

}

TY - GEN

T1 - Optimal algorithms for restricted single row routing problems

AU - Hossain, Moazzem

AU - Sherwani, Naveed A.

AU - Deogun, Jitender

PY - 1991

Y1 - 1991

N2 - In this paper, we consider some restricted single row routing problems. 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, clique.

AB - In this paper, we consider some restricted single row routing problems. 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, clique.

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

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

U2 - 10.1109/MWSCAS.1991.252086

DO - 10.1109/MWSCAS.1991.252086

M3 - Conference contribution

AN - SCOPUS:79955064703

T3 - Midwest Symposium on Circuits and Systems

SP - 823

EP - 826

BT - 1991 Proceedings of the 34th Midwest Symposium on Circuits and Systems, MWSCAS 1991

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 34th Midwest Symposium on Circuits and Systems, MWSCAS 1991

Y2 - 14 May 1992 through 17 May 1992

ER -

Optimal algorithms for restricted single row routing problems

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this