Constraint graph (layout)

Known as: Horizontal constraint graph, Vertical constraint graph

In some tasks of integrated circuit layout design a necessity arises to optimize placement of non-overlapping objects in the plane. In general this…

Papers overview

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

2004

Historically, channel routers have limited themselves to Manhattan routing. This has resulted in inefficiencies, particularly in…

1998

Local Optimality paradigm is applicable to all combinatorial optimization problems. Its direct field of application are the…

1997

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

1996

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

1995

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

1993

Demonstrates that the vertical constraint graph (VCG) is not a complete representation of the vertical constraints of a channel…

1991

A hierarchical pin permutation algorithm is presented which is used as a preprocessor of conventional channel routing algorithms…

1985

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