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

@article{Aggarwal1996NodedisjointPO,
  title={Node-disjoint paths on the mesh and a new trade-off in VLSI layout},
  author={Alok Aggarwal and Jon M. Kleinberg and David P. Williamson},
  journal={SIAM J. Comput.},
  year={1996},
  volume={29},
  pages={1321-1333}
}
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… 

Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI

3-dimensional Routing

The above problems are motivated by VLSI design, where technological improvements of the past two decades motivated the research of routing problems with a “real” 3-dimensional flavour and a few recent results are surveyed.

On Approximating Node-Disjoint Paths in Grids

The algorithm shows that when all demand pairs are of the latter type, the integrality gap of the multicommodity flow LP-relaxation is at most O(n^{1/4} * log(n), and it is complemented by proving that NDP is APX-hard on grid graphs.

Complexity of pairwise shortest path routing in the grid

n-Cube Network : Node Disjoint Shortest Paths for Pairsof VerticesTeo

An eecient algorithm for the n-cube pairwise node disjoint shortest paths problem in the presence of faulty nodes and an O(m 2:5) time algorithm, where m is the input length, to construct a set of such paths.

A Set-to-Set Disjoint Paths Routing Algorithm in Tori

It is proved that the paths selected by the proposed algorithm have lengths at most 2( k +1) n  and can be obtained with a time complexity of O ( kn 3 n 3 log n ).

3-dimensional Channel Routing

Every problem instance is so lvable in polynomial time with height h = O (max( n, w )) that this linear bound is best possible (apart from a constant factor).

Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary

This work uses a (completely different) linear program only to select the pairs to be routed, while the routing itself is computed by other methods, resulting in an efficient randomized $2^{O(\sqrt{\log n} \cdot \log\log n)}$-approximation algorithm for this problem.

Set-to-Set Disjoint Paths in Tori

  • K. KanekoA. Bossard
  • Computer Science
    2016 Fourth International Symposium on Computing and Networking (CANDAR)
  • 2016
This paper proposes an algorithm that constructs 2n mutually node-disjoint paths from a set S of 2n source nodes to a set D of2n destination nodes in an n-dimensional k-ary torus Tn,k (n¡Ã 1, k ¡Ã 3).

A lower bound for the tree-width of planar graphs with vital linkages

Robertson and Seymour have proven that the disjoint paths problem can be solved in polynomial time if k is fixed, and give single exponential lower bounds both for the tree-width of planar graphs with vital linkages, and for the size of the grid necessary for finding irrelevant vertices.

References

SHOWING 1-10 OF 17 REFERENCES

Disjoint paths in densely embedded graphs

This work considers the class of densely embedded, nearly-Eulerian graphs, which includes the two-dimensional mesh and other planar and locally planar interconnection networks, and obtains a constant-factor approximation algorithm for the maximum disjoint paths problem for this class of graphs.

Algorithms for routing and testing routability of planar VLSI layouts

These algorithms subsume most of the polynomial-time algorithms in the literature for planar routing and routability testing in the rectilinear grid model and provide an explicit construction of a database to support computation involving the layout topology.

LAYOUT FOR THE SHUFFLE-EXCHANGE GRAPH AND LOWER BOUND TECHNIQUES FOR VLSI

The area results indicate that some graphs with O(N )-separators do not have linear-area layouts, thus disproving a popular conjecture, and the edge length bounds indicate that the layouts of some networks must have very long wires.

Multi-layer grid embeddings

An O(n2) area embedding of planar graphs such that each edge makes a constant number of turns, and each exterior vertex has a path to the perimeter of the grid making a constantNumber of turns is given.

Efficient routing in all-optical networks

This work presents licient routing techniques for the two types of photonic switches that dominate current research in all-optical networks, and studies the problem of routing a set of requests on sparse networks using a limited number of wavelengths.

River Routing Every Which Way, but Loose (Extended Abstract)

A solution to the 'Detailed Routing given a Homotopy' (DRH) problem is given in O(n + mlogm + D(m)) operations, where O(m) is the total number of crossin s occurring for selected test segments.

The "PI" (Placement And Interconnect) System

  • R. Rivest
  • Computer Science
    19th Design Automation Conference
  • 1982
The structure of PI is reviewed, and details on the signal-routing heuristics are presented, focusing on the definition of "channels", the global router, the "crossing placer", and the channel routers.

A Tight Lower Bound on the Size of Planar Permutation Networks

A tight lower bound is proved on the minimum number of vertices in a planar graph in which any permutation between t distinguished vertices can be realized by vertex disjoint paths.

Permutation layout

Disjoint homotopic paths and trees in a planar graph

  • A. Schrijver
  • Mathematics, Computer Science
    Discret. Comput. Geom.
  • 1991
This paper describes a polynomial-time algorithm and proves a theorem characterizing the existence of a solution to this problem and extends the algorithm to disjoint homotopic trees.