Preprocessing Steiner problems from VLSI layout
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 219265
- scientific article; zbMATH DE number 1424551
- The Steiner tree packing problem in VLSI design
- scientific article; zbMATH DE number 4191148
- A framework for solving VLSI graph layout problems
- Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
- scientific article; zbMATH DE number 833244
- Efficient preprocessing for VLSI optimization problems
- Class Steiner trees and VLSI-design
- Shortest paths and Steiner trees in VLSI routing
Cites work
- scientific article; zbMATH DE number 4010182 (Why is no real title available?)
- An algorithm for the steiner problem in graphs
- Dual heuristics on the exact solution of large Steiner problems
- Improved algorithms for the Steiner problem in networks
- Problem reduction methods and a tree generation algorithm for the steiner network problem
- Reduction tests for the steiner problem in grapsh
- Reductions for the rectilinear steiner tree problem
- Solving Steiner tree problems in graphs to optimality
- Steiner problem in networks: A survey
Cited in
(21)- scientific article; zbMATH DE number 4191148 (Why is no real title available?)
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic
- Dual heuristics on the exact solution of large Steiner problems
- A fast and efficient algorithm for determining the connected orthogonal convex hulls
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
- A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
- Implications, conflicts, and reductions for Steiner trees
- Implications, conflicts, and reductions for Steiner trees
- Reduction tests for the prize-collecting Steiner problem
- scientific article; zbMATH DE number 1424551 (Why is no real title available?)
- A robust and scalable algorithm for the Steiner problem in graphs
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- Approaches to the Steiner Problem in Networks
- Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Separating bichromatic point sets in the plane by restricted orientation convex hulls
- The Steiner tree problem with delays: a compact formulation and reduction procedures
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- The Steiner tree packing problem in VLSI design
- Rectilinear convex hull with minimum area
- A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction
This page was built for publication: Preprocessing Steiner problems from VLSI layout
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785218)
