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

  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},
  • 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
    23 Citations
    Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
    • 8
    • PDF
    3-dimensional Routing
    • PDF
    On Approximating Node-Disjoint Paths in Grids
    • 12
    • PDF
    Complexity of pairwise shortest path routing in the grid
    • 9
    • PDF
    A Set-to-Set Disjoint Paths Routing Algorithm in Tori
    • 6
    • PDF
    3-dimensional Channel Routing
    • 3
    • PDF
    Set-to-Set Disjoint Paths in Tori
    A lower bound for the tree-width of planar graphs with vital linkages
    • 2
    • PDF
    The Container Problem in a Torus-connected Cycles Network
    • 1


    Disjoint homotopic paths and trees in a planar graph
    • A. Schrijver
    • Mathematics, Computer Science
    • Discret. Comput. Geom.
    • 1991
    • 24
    • Highly Influential
    • PDF
    Permutation layout
    • 18
    • Highly Influential
    Efficient all-optical routing
    • Proc. 26th ACM STOC, 1994.
    • 1994