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 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
Topics from this paper
23 Citations
Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
- Computer Science, Mathematics
- Discret. Appl. Math.
- 2007
- 8
- PDF
Complexity of pairwise shortest path routing in the grid
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2004
- 9
- PDF
Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary
- Mathematics, Computer Science
- ICALP
- 2018
- 5
- PDF
Set-to-Set Disjoint Paths in Tori
- Computer Science
- 2016 Fourth International Symposium on Computing and Networking (CANDAR)
- 2016
A lower bound for the tree-width of planar graphs with vital linkages
- Mathematics, Computer Science
- ArXiv
- 2010
- 2
- PDF
References
SHOWING 1-3 OF 3 REFERENCES
Disjoint homotopic paths and trees in a planar graph
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 1991
- 24
- Highly Influential
- PDF
Efficient all-optical routing
- Proc. 26th ACM STOC, 1994.
- 1994