Integer programming in VLSI design

DOI10.1016/0166-218X(92)90020-BzbMath0759.90074MaRDI QIDQ1201818

Prabhakar Raghavan

Publication date: 17 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

VLSI designpolynomial timewire routingmultiterminal multicommodity flowsPLA partitioning

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Multiterminal global routing: A deterministic approximation scheme
• Global wire routing in two-dimensional arrays
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• ``Integer-making theorems
• Six Standard Deviations Suffice
• A decomposition algorithm for circuit routing

This page was built for publication: Integer programming in VLSI design