Pages that link to "Item:Q3197850"
From MaRDI portal
The following pages link to Via Minimization with Pin Preassignments and Layer Preference (Q3197850):
Displaying 14 items.
- On the diameter of cut polytopes (Q271649) (← links)
- Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- From equipartition to uniform cut polytopes: extended polyhedral results (Q533779) (← links)
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems (Q643005) (← links)
- Conjugate conflict continuation graphs for multi-layer constrained via minimization (Q881874) (← links)
- Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← links)
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
- Constrained via minimization for three-layer routing (Q1119490) (← links)
- An integrated approach to routing and via minimization (Q1183405) (← links)
- The pin redistribution problem in multi-chip modules (Q1327562) (← links)
- Steiner tree packing revisited (Q1935940) (← links)
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design (Q3790963) (← links)
- Optimal control of plotting and drilling machines: A case study (Q5202834) (← links)