Combinatorial optimization in VLSI design
From MaRDI portal
Recommendations
Cited in
(26)- Some combinatorial optimization problems arising from VLSI circuit design
- Multilevel optimization in VLSICAD
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- Steiner tree packing revisited
- Local search with a SAT oracle for combinatorial optimization
- Combinatorial Problems in Chip Design
- scientific article; zbMATH DE number 3970689 (Why is no real title available?)
- Optimal VLSI circuits for sorting
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 1058028 (Why is no real title available?)
- scientific article; zbMATH DE number 4114383 (Why is no real title available?)
- scientific article; zbMATH DE number 750011 (Why is no real title available?)
- Retracting Graphs to Cycles
- Steiner trees with bounded RC-delay
- Digital Circuit Optimization via Geometric Programming
- Multiscale optimization in VLSI physical design automation
- scientific article; zbMATH DE number 956793 (Why is no real title available?)
- Travelling on graphs with small highway dimension
- VLSI circuit performance optimization by geometric programming
- A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem
- Some applications of combinatorial optimization in parallel computing
- Fully dynamic algorithms for Euclidean Steiner tree
- Statistical static timing analysis via modern optimization lens. I: Histogram-based approach
- A fast 3-approximation for the capacitated tree cover problem with edge loads
- A partition-and-merge algorithm for solving the Steiner tree problem in large graphs
- Efficient preprocessing for VLSI optimization problems
This page was built for publication: Combinatorial optimization in VLSI design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928707)
