Pages that link to "Item:Q4785218"

The following pages link to Preprocessing Steiner problems from VLSI layout (Q4785218):

Displaying 17 items.

• The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
• A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
• Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
• Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations (Q2022326) (← links)
• A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set (Q2242054) (← links)
• Reduction tests for the prize-collecting Steiner problem (Q2466593) (← links)
• A fast and efficient algorithm for determining the connected orthogonal convex hulls (Q2671859) (← links)
• Separating bichromatic point sets in the plane by restricted orientation convex hulls (Q2694525) (← links)
• (Q2741494) (← links)
• Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
• Approaches to the Steiner Problem in Networks (Q3637313) (← links)
• Rectilinear Convex Hull with Minimum Area (Q4899283) (← links)
• Implications, conflicts, and reductions for Steiner trees (Q5918437) (← links)
• Implications, conflicts, and reductions for Steiner trees (Q5925647) (← links)
• Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic (Q6066592) (← links)
• Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View (Q6068262) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)