@inproceedings{4471d4b532c040138f0d762fe3cfa0bd,
title = "Optimal layer assignment for escape routing of buses",
abstract = "Escape routing is a critical problem in PCB design. In ICCAD'07, a layer assignment algorithm was proposed for escape routing of buses. The algorithm is optimal for single layer design in the sense that it determines if a set of buses can all be escaped on one layer. If they cannot, the algorithm is able to select a maximum subset of the buses that can be escaped on one layer. This, in turn, leads to a heuristic for the layer assignment problem with multiple layers, which is to repeatedly assign a maximum subset of the unassigned buses to a new layer. In this work, we present an algorithm that solves the multi-layer layer assignment problem optimally. Our algorithm guarantees to produce a layer assignment with minimum number of layers. We applied our algorithm on industrial data and obtained encouraging results.",
keywords = "Bus, Escape routing, Layer assignment, Printed circuit board (PCB)",
author = "Tan Yan and Hui Kong and Wong, {Martin D.F.}",
year = "2009",
doi = "10.1145/1687399.1687444",
language = "English (US)",
isbn = "9781605588001",
series = "IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "245--248",
booktitle = "Proceedings of the 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers, ICCAD 2009",
address = "United States",
note = "2009 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2009 ; Conference date: 02-11-2009 Through 05-11-2009",
}