• DOI:10.1145/237814.238007
Corpus ID: 16158587

Node-disjoint paths on the mesh and a new trade-off in VLSI layout

@inproceedings{Aggarwal1996NodedisjointPO,
  title={Node-disjoint paths on the mesh and a new trade-off in VLSI layout},
  author={A. Aggarwal and J. Kleinberg and David P. Williamson},
  booktitle={STOC '96},
  year={1996}
}

A. Aggarwal, J. Kleinberg, David P. Williamson

Published in STOC '96 1996

Mathematics, Computer Science

A number of basic models for VLSI layout are based on the construction of node- disjoint paths between terminals on a multilayer grid. In this setting, one is interested in minimizing both the number of layers required and the area of the underlying grid. Building on work of Cutler and Shiloach (Networks, 8 (1978), pp. 253{278), Aggarwal et al. (Proc. 26th IEEE Symposium on Foundations of Computer Science, Portland, OR, 1985; Algorithmica, 6 (1991), pp. 241{255), and Aggarwal, Klawe, and Shor… CONTINUE READING

View on ACM

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed