scientific article; zbMATH DE number 750011
From MaRDI portal
Publication:4764186
Recommendations
- Performance optimization of VLSI interconnect layout
- On VLSI interconnect optimization and linear ordering problem
- Algorithm study for VLSI interconnections
- Interconnects in VLSI design
- Interconnect synthesis in high speed digital VLSI routing
- scientific article; zbMATH DE number 2127785
- Optimal interconnection in digital systems satisfying concurrency constraints
- The complexity of minimizing wire lengths in VLSI layouts
- Combinatorial optimization in VLSI design
Cited in
(26)- On Rajagopalan and Vazirani's \(\frac{3}{2}e\)-approximation bound for the iterated 1-Steiner heuristic
- Delay-related secondary objectives for rectilinear Steiner minimum trees.
- Bottleneck Steiner tree with bounded number of Steiner vertices
- The Euclidean bottleneck full Steiner tree problem
- A near linear time approximation scheme for Steiner tree among obstacles in the plane
- Computing optimal Steiner trees in polynomial space
- Extending the kernel for planar Steiner tree to the number of Steiner vertices
- Steiner hull algorithm for the uniform orientation metrics
- An improved approximation scheme for the Group Steiner Problem
- Interconnects in VLSI design
- Algorithmic aspects of VLSI layout.
- Performance optimization of VLSI interconnect layout
- scientific article; zbMATH DE number 2127785 (Why is no real title available?)
- An Efficient Approximation Algorithm for the Steiner Tree Problem
- Optimal competitiveness for the rectilinear Steiner arborescence problem
- Steiner trees with bounded RC-delay
- (1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree
- Faster Steiner Tree Computation in Polynomial-Space
- Handbook of Algorithms for Physical Design Automation
- Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
- Parameterized complexity of directed Steiner tree on sparse graphs
- Steiner trees with bounded RC-delay
- Optimal wire ordering and spacing in low power semiconductor design
- A better constant-factor approximation for selected-internal Steiner minimum tree
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2
- Approximating the selected-internal Steiner tree
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764186)
