The Steiner tree packing problem in VLSI design
From MaRDI portal
(Redirected from Publication:1373751)
Recommendations
- Publication:3210200
- Steiner tree packing revisited
- scientific article; zbMATH DE number 108281
- Class Steiner trees and VLSI-design
- Packing Steiner trees: Polyhedral investigations
- Packing Steiner trees: Further facets
- scientific article; zbMATH DE number 2079349
- Packing Steiner trees
- Packing the Steiner trees of a graph
- Preprocessing Steiner problems from VLSI layout
Cites work
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 108281 (Why is no real title available?)
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- Packing Steiner Trees: Separation Algorithms
- Packing Steiner trees: A cutting plane algorithm and computational results
- Packing Steiner trees: Polyhedral investigations
- The Rectilinear Steiner Tree Problem is $NP$-Complete
Cited in
(31)- A branch-and-price algorithm for switch-box routing
- OR Practice—Lagrangian Relaxation for Testing Infeasibility in VLSI Routing
- scientific article; zbMATH DE number 4191148 (Why is no real title available?)
- Directed cycle \(k\)-connectivity of complete digraphs and complete regular bipartite digraphs
- The cavity approach for Steiner trees packing problems
- Hardness and approximation results for packing Steiner trees
- A branch-and-price algorithm for the Steiner tree packing problem.
- Packing strong subgraph in digraphs
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- On routing in VLSI design and communication networks
- Packing the Steiner trees of a graph
- Heuristics for automated knowledge source integration and service composition
- Combinatorial optimization in system configuration design
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs
- Routing in grid graphs by cutting planes
- Directed Steiner tree packing and directed tree connectivity
- The minimum size of a graph with given tree connectivity
- Preprocessing Steiner problems from VLSI layout
- On two generalized connectivities of graphs
- A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction
- Packing Steiner trees with identical terminal sets
- Packing trees in communication networks
- Steiner tree packing revisited
- Constructing edge-disjoint Steiner paths in lexicographic product networks
- Algorithms and Computation
- Graphs with large generalized (edge-)connectivity
- Path-connectivity of lexicographic product graphs
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- A solution to a conjecture on the generalized connectivity of graphs
- Mathematical methods for physical layout of printed circuit boards: an overview
- Constructing internally disjoint pendant Steiner trees in Cartesian product networks
This page was built for publication: The Steiner tree packing problem in VLSI design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373751)
