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

@inproceedings{Cole1984RiverRE,
  title={River Routing Every Which Way, but Loose (Extended Abstract)},
  author={Richard Cole and Alan Siegel},
  booktitle={FOCS},
  year={1984}
}
  • Richard Cole, Alan Siegel
  • Published in FOCS 1984
  • Computer Science
  • A solution to the 'Detailed Routing given a Homotopy' (DRH) problem is given in O(n + mlogm + D(m)) operations. The solution uses n + mlogm homotopy queries that are elementary; they are answerable based solely on "local properties" of modules, terminals, and wire connections. In addition, we need O(m) more complex queries, which are represented in the D(m) term. These queries must account for the total number of crossin s occurringfor selected test segments. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Figures and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 49 CITATIONS

    Combinatorial Optimization

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Optimal Geometric Flows via Dual Programs

    VIEW 11 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    A Faster One-Dimensional Topological Compaction Algorithm

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Drawing with Fat Edges

    VIEW 9 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion

    VIEW 5 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Minimum Separation for Single-Layer Channel Routing

    VIEW 5 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Efficient Interconnection Schemes for VLSI and Parallel Computation

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Homotopic 𝒞-oriented routing with few links and thick edges

    VIEW 1 EXCERPT
    CITES BACKGROUND