Computational complexity for uniform orientation Steiner tree problems

Authors:
M. Brazil;M. Zachariasen
Affiliations:
The University of Melbourne, Victoria, Australia;University of Copenhagen, Copenhagen Ø, Denmark
Venue:
ACSC '13 Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135
Year:
2013

Citing 5
Cited 0

Steiner Trees for Terminals Constrained to Curves

SIAM Journal on Discrete Mathematics
The X architecture: not your father's diagonal wiring

SLIP '02 Proceedings of the 2002 international workshop on System-level interconnect prediction
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Steiner trees for fixed orientation metrics

Journal of Global Optimization
The Y architecture for on-chip interconnect: analysis and methodology

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a straighforward proof that the uniform orientation Steiner tree problem, also known as the λ-geometry Steiner tree problem, is NP-hard whenever the number of orientations, λ, is a multiple of 3. We also briefly outline how this result can be generalised to every λ 2.