The rectilinear Steiner arborescence problem is NP-complete

Authors:
Weiping Shi;Chen Su
Affiliations:
Department of Computer Science, University of North Texas, Denton, Texas;Department of Computer Science, University of North Texas, Denton, Texas
Venue:
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Year:
2000

Citing 5
Cited 13

Performance-driven interconnect design based on distributed RC delay model

DAC '93 Proceedings of the 30th international Design Automation Conference
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
New performance-driven FPGA routing algorithms

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem

Journal of Global Optimization
Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem

Proceedings of the 2004 ACM symposium on Applied computing
Minimum moment Steiner trees

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An automated technique for topology and route generation of application specific on-chip interconnection networks

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
A tree-based genetic algorithm for building rectilinear Steiner arborescences

Proceedings of the 8th annual conference on Genetic and evolutionary computation
The minimum Manhattan network problem: approximations and exact solutions

Computational Geometry: Theory and Applications
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images

Computer Vision and Image Understanding
The minimum Manhattan network problem: Approximations and exact solutions

Computational Geometry: Theory and Applications
The Transitive Minimum Manhattan Subnetwork Problem in 3 dimensions

Discrete Applied Mathematics
Physical synthesis of bus matrix for high bandwidth low power on-chip communications

Proceedings of the 19th international symposium on Physical design
Low-power gated bus synthesis for 3d ic via rectilinear shortest-path steiner graph

Proceedings of the 2012 ACM international symposium on International Symposium on Physical Design
Angle-restricted steiner arborescences for flow map layout

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Shallow-Light steiner arborescences with vertex delays

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract