Pages that link to "Item:Q2928707"
From MaRDI portal
The following pages link to Combinatorial optimization in VLSI design (Q2928707):
Displaying 18 items.
- Steiner trees with bounded RC-delay (Q527413) (← links)
- Efficient preprocessing for VLSI optimization problems (Q967209) (← links)
- Some combinatorial optimization problems arising from VLSI circuit design (Q1319148) (← links)
- Multilevel optimization in VLSICAD (Q1412851) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- On the edge-length ratio of outerplanar graphs (Q1740698) (← links)
- Steiner tree packing revisited (Q1935940) (← links)
- Local search with a SAT oracle for combinatorial optimization (Q2233496) (← links)
- Optimal VLSI circuits for sorting (Q3816988) (← links)
- (Q3997942) (← links)
- (Q4764186) (← links)
- Retracting Graphs to Cycles (Q5091228) (← links)
- Digital Circuit Optimization via Geometric Programming (Q5322147) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
- VLSI circuit performance optimization by geometric programming (Q5959326) (← links)
- A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem (Q6164361) (← links)
- Fully dynamic algorithms for Euclidean Steiner tree (Q6575381) (← links)
- Statistical static timing analysis via modern optimization lens. I: Histogram-based approach (Q6640166) (← links)