Preprocessing Steiner problems from VLSI layout
From MaRDI portal
Publication:4785218
DOI10.1002/net.10035zbMath1064.68007OpenAlexW2039706936MaRDI QIDQ4785218
No author found.
Publication date: 17 December 2002
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10035
Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)
Related Items (17)
A robust and scalable algorithm for the Steiner problem in graphs ⋮ Unnamed Item ⋮ A fast and efficient algorithm for determining the connected orthogonal convex hulls ⋮ Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm ⋮ Separating bichromatic point sets in the plane by restricted orientation convex hulls ⋮ Rectilinear Convex Hull with Minimum Area ⋮ The Steiner tree problem with delays: a compact formulation and reduction procedures ⋮ Reduction tests for the prize-collecting Steiner problem ⋮ A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set ⋮ Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View ⋮ Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Approaches to the Steiner Problem in Networks ⋮ Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Problem reduction methods and a tree generation algorithm for the steiner network problem
- Steiner problem in networks: A survey
- Reduction tests for the steiner problem in grapsh
- Solving Steiner tree problems in graphs to optimality
- Reductions for the rectilinear steiner tree problem
- An algorithm for the steiner problem in graphs
- Improved algorithms for the Steiner problem in networks
This page was built for publication: Preprocessing Steiner problems from VLSI layout