Amanote Research
Register
Sign In
Obstacle-Avoiding Rectilinear Steiner Tree Construction
doi 10.1109/iccad.2008.4681625
Full Text
Open PDF
Abstract
Available in
full text
Date
November 1, 2008
Authors
Evangeline F. Y. Young
Publisher
IEEE
Related search
Fixed-Parameter Algorithms for Rectilinear Steiner Tree and Rectilinear Traveling Salesman Problem in the Plane
European Journal of Operational Research
Information Systems
Simulation
Management Science
Management
Computer Science
Modeling
Operations Research
The Rectilinear Steiner Ratio
ORiON
Efficient Steiner Tree Construction Based on Spanning Graphs
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Electrical
Software
Computer Graphics
Computer-Aided Design
Electronic Engineering
Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions
Discrete and Computational Geometry
Combinatorics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
Computing Optimal Rectilinear Steiner Trees: A Survey and Experimental Evaluation
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Obstacle-Avoiding Path Existence Queries in a Simple Polygon
New Pruning Rules for the Steiner Tree Problem and 2-Connected Steiner Network Problem
Computational Geometry: Theory and Applications
Control
Optimization
Geometry
Computational Theory
Computer Science Applications
Computational Mathematics
Mathematics
Topology
Separator-Based Pruned Dynamic Programming for Steiner Tree
Proceedings of the AAAI Conference on Artificial Intelligence
