A randomized algorithm for the fixed-length routing problem

Tieyuan Pan; Ran Zhang; Yasuhiro Takashima; Takahiro Watanabe

doi:10.1109/APCCAS.2014.7032880

A randomized algorithm for the fixed-length routing problem

Tieyuan Pan, Ran Zhang, Yasuhiro Takashima, Takahiro Watanabe

Graduate School of Information, Production and Systems

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

Abstract

In this paper, we propose a fixed-length routing method in Printed Circuit Board (PCB). The proposed method utilizes the simpath algorithm with a randomized graph reduction. It outputs the routing of the nets with small length-error. Its efficiency is confirmed empirically.

Original language	English
Title of host publication	2014 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2014
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	711-714
Number of pages	4
Edition	February
ISBN (Electronic)	9781479952304
DOIs	https://doi.org/10.1109/APCCAS.2014.7032880
Publication status	Published - 2015 Feb 5
Event	2014 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2014 - Ishigaki Island, Okinawa, Japan Duration: 2014 Nov 17 → 2014 Nov 20

Publication series

Name	IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS
Number	February
Volume	2015-February

Other

Other	2014 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2014
Country/Territory	Japan
City	Ishigaki Island, Okinawa
Period	14/11/17 → 14/11/20

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/APCCAS.2014.7032880

Cite this

Pan, T., Zhang, R., Takashima, Y., & Watanabe, T. (2015). A randomized algorithm for the fixed-length routing problem. In 2014 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2014 (February ed., pp. 711-714). Article 7032880 (IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS; Vol. 2015-February, No. February). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/APCCAS.2014.7032880

A randomized algorithm for the fixed-length routing problem. / Pan, Tieyuan; Zhang, Ran; Takashima, Yasuhiro et al.
2014 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2014. February. ed. Institute of Electrical and Electronics Engineers Inc., 2015. p. 711-714 7032880 (IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS; Vol. 2015-February, No. February).

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

Pan, T, Zhang, R, Takashima, Y & Watanabe, T 2015, A randomized algorithm for the fixed-length routing problem. in 2014 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2014. February edn, 7032880, IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS, no. February, vol. 2015-February, Institute of Electrical and Electronics Engineers Inc., pp. 711-714, 2014 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2014, Ishigaki Island, Okinawa, Japan, 14/11/17. https://doi.org/10.1109/APCCAS.2014.7032880

Pan T, Zhang R, Takashima Y, Watanabe T. A randomized algorithm for the fixed-length routing problem. In 2014 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2014. February ed. Institute of Electrical and Electronics Engineers Inc. 2015. p. 711-714. 7032880. (IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS; February). doi: 10.1109/APCCAS.2014.7032880

@inproceedings{86ea7660df8e4d569254abd6d0ff8ab0,

title = "A randomized algorithm for the fixed-length routing problem",

abstract = "In this paper, we propose a fixed-length routing method in Printed Circuit Board (PCB). The proposed method utilizes the simpath algorithm with a randomized graph reduction. It outputs the routing of the nets with small length-error. Its efficiency is confirmed empirically.",

author = "Tieyuan Pan and Ran Zhang and Yasuhiro Takashima and Takahiro Watanabe",

year = "2015",

month = feb,

day = "5",

doi = "10.1109/APCCAS.2014.7032880",

language = "English",

series = "IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS",

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

number = "February",

pages = "711--714",

booktitle = "2014 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2014",

edition = "February",

note = "2014 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2014 ; Conference date: 17-11-2014 Through 20-11-2014",

}

TY - GEN

T1 - A randomized algorithm for the fixed-length routing problem

AU - Pan, Tieyuan

AU - Zhang, Ran

AU - Takashima, Yasuhiro

AU - Watanabe, Takahiro

PY - 2015/2/5

Y1 - 2015/2/5

N2 - In this paper, we propose a fixed-length routing method in Printed Circuit Board (PCB). The proposed method utilizes the simpath algorithm with a randomized graph reduction. It outputs the routing of the nets with small length-error. Its efficiency is confirmed empirically.

AB - In this paper, we propose a fixed-length routing method in Printed Circuit Board (PCB). The proposed method utilizes the simpath algorithm with a randomized graph reduction. It outputs the routing of the nets with small length-error. Its efficiency is confirmed empirically.

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

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

U2 - 10.1109/APCCAS.2014.7032880

DO - 10.1109/APCCAS.2014.7032880

M3 - Conference contribution

AN - SCOPUS:84937819920

T3 - IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS

SP - 711

EP - 714

BT - 2014 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2014

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2014

Y2 - 17 November 2014 through 20 November 2014

ER -

A randomized algorithm for the fixed-length routing problem

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this