Steiner Minimal Trees for Three Points with one Conrex Polygonal Obstacle
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Standard
Steiner Minimal Trees for Three Points with one Conrex Polygonal Obstacle. / Winter, P.; Smith, J. MacGregor.
I: Annals of Operations Research, Nr. 33, 1991, s. 577-599.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Harvard
Winter, P & Smith, JM 1991, 'Steiner Minimal Trees for Three Points with one Conrex Polygonal Obstacle', Annals of Operations Research, nr. 33, s. 577-599.
APA
Winter, P., & Smith, J. M. (1991). Steiner Minimal Trees for Three Points with one Conrex Polygonal Obstacle. Annals of Operations Research, (33), 577-599.
Vancouver
Winter P, Smith JM. Steiner Minimal Trees for Three Points with one Conrex Polygonal Obstacle. Annals of Operations Research. 1991;(33):577-599.
Author
Bibtex
@article{271cfe4074d111dbbee902004c4f4f50,
title = "Steiner Minimal Trees for Three Points with one Conrex Polygonal Obstacle",
abstract = "Datalogi, computational geometry",
author = "P. Winter and Smith, {J. MacGregor}",
year = "1991",
language = "English",
pages = "577--599",
journal = "Annals of Operations Research",
issn = "0254-5330",
publisher = "Springer",
number = "33",
}
RIS
TY - JOUR
T1 - Steiner Minimal Trees for Three Points with one Conrex Polygonal Obstacle
AU - Winter, P.
AU - Smith, J. MacGregor
PY - 1991
Y1 - 1991
N2 - Datalogi, computational geometry
AB - Datalogi, computational geometry
M3 - Journal article
SP - 577
EP - 599
JO - Annals of Operations Research
JF - Annals of Operations Research
SN - 0254-5330
IS - 33
ER -
ID: 305872