Computational complexity for uniform orientation Steiner tree problems

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Standard

Computational complexity for uniform orientation Steiner tree problems. / Brazil, M.; Zachariasen, Martin.

Proceedings of the Thirty-Sixth Australasian Computer Science Conference. ed. / Bruce Thomas. Vol. 135 Australian Computer Society, 2013. p. 107-113.

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Harvard

Brazil, M & Zachariasen, M 2013, Computational complexity for uniform orientation Steiner tree problems. in B Thomas (ed.), Proceedings of the Thirty-Sixth Australasian Computer Science Conference. vol. 135, Australian Computer Society, pp. 107-113, 36th Australasian Computer Science Conference, Adelaide, Australia, 29/01/2013. <http://dl.acm.org/citation.cfm?id=2525401.2525413>

APA

Brazil, M., & Zachariasen, M. (2013). Computational complexity for uniform orientation Steiner tree problems. In B. Thomas (Ed.), Proceedings of the Thirty-Sixth Australasian Computer Science Conference (Vol. 135, pp. 107-113). Australian Computer Society. http://dl.acm.org/citation.cfm?id=2525401.2525413

Vancouver

Brazil M, Zachariasen M. Computational complexity for uniform orientation Steiner tree problems. In Thomas B, editor, Proceedings of the Thirty-Sixth Australasian Computer Science Conference. Vol. 135. Australian Computer Society. 2013. p. 107-113

Author

Brazil, M. ; Zachariasen, Martin. / Computational complexity for uniform orientation Steiner tree problems. Proceedings of the Thirty-Sixth Australasian Computer Science Conference. editor / Bruce Thomas. Vol. 135 Australian Computer Society, 2013. pp. 107-113

Bibtex

@inproceedings{5ebaafc462ad4368bbcd9f3efdb671bf,
title = "Computational complexity for uniform orientation Steiner tree problems",
keywords = "lambda-geometry, NP-hard, Steiner tree problem, computational complexity",
author = "M. Brazil and Martin Zachariasen",
year = "2013",
language = "English",
isbn = "978-1-921770-20-3",
volume = "135",
pages = "107--113",
editor = "Bruce Thomas",
booktitle = "Proceedings of the Thirty-Sixth Australasian Computer Science Conference",
publisher = "Australian Computer Society",
note = "36th Australasian Computer Science Conference, ACSC '13 ; Conference date: 29-01-2013 Through 01-02-2013",

}

RIS

TY - GEN

T1 - Computational complexity for uniform orientation Steiner tree problems

AU - Brazil, M.

AU - Zachariasen, Martin

N1 - Conference code: 36

PY - 2013

Y1 - 2013

KW - lambda-geometry, NP-hard, Steiner tree problem, computational complexity

M3 - Article in proceedings

SN - 978-1-921770-20-3

VL - 135

SP - 107

EP - 113

BT - Proceedings of the Thirty-Sixth Australasian Computer Science Conference

A2 - Thomas, Bruce

PB - Australian Computer Society

T2 - 36th Australasian Computer Science Conference

Y2 - 29 January 2013 through 1 February 2013

ER -

ID: 99734694