Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

1998

1998

This paper presents a two layer channel router with no doglegs, based on a hybridization of Stochastic Evolution and Tabu search… Expand

Is this relevant?

1997

1997

This paper proposes an efficient paired-net routing algorithm. A paired net consists of two nets assigned to adjacent tracks and… Expand

Is this relevant?

1996

1996

Existing theory has supported deterministic polynomial time procedures for locally optimal breaking (LOB) of two classes of… Expand

Is this relevant?

1995

1995

Locally optimal breaking strategy was already developed for disjoint directed circuits in the vertical constraint graph. The… Expand

Is this relevant?

1993

1993

The channel routing problem in VLSI design is to route a specified interconnection among modules in as small an area as possible… Expand

Is this relevant?

1993

1993

The WISER algorithm for over-the-cell channel routing in the standard cell design style using the two-layer routing model is… Expand

Is this relevant?

1988

1988

Two subproblems that arise when routing channels with interchangeable terminals are shown to be NP-hard. These problems are: (1… Expand

Is this relevant?

1987

1987

We present a hybrid three-layer channel-routing algorithm that combines horizontal-vertical-horizontal (HVH) and vertical… Expand

Is this relevant?

1985

1985

The channel router, which routes a rectangular channel with two rows of terminals along its top and bottom sides, is extensively… Expand

Is this relevant?

1983

1983

A new approach to the 2-layer channel-routing problem is introduced. The method allows horizontal and vertical connections on… Expand

Is this relevant?