Optimal single row router

Authors:
Raghunath Raghavan;Sartaj Sahni
Affiliations:
-;-
Venue:
DAC '82 Proceedings of the 19th Design Automation Conference
Year:
1982

Citing 4
Cited 1

Fundamentals of data structures in PASCAL

Fundamentals of data structures in PASCAL
A high-density multilayer PCB router based on necessary and sufficient conditions for single row routing

DAC '81 Proceedings of the 18th Design Automation Conference
On the layering problem of multilayer PWB wiring

DAC '81 Proceedings of the 18th Design Automation Conference
A topologically based non-minimum distance routing algorithm

DAC '78 Proceedings of the 15th Design Automation Conference

Layering algorithms for single row routing

DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

The single row approach represents a systematic suboptimal approach to the general multilayer rectilinear wire problem. With this approach, the single row wiring problem (i.e., one where all the points are collinear) forms the backbone of the general multilayer wiring problem. We consider the problem of generating minimum width layout for single row wiring problems. Our algorithm, which is not grid-based, is enumerative and uses a strong bounding criterion.