Steiner minimal trees in rectilinear and octilinear planes (Q2463797): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10114-005-0910-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2115416999
@@ Property / OpenAlex ID: W2115416999 / rank @@
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem
@@ Property / cites work: The Steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+On Steiner’s Problem with Rectilinear Distance
@@ Property / cites work: On Steiner’s Problem with Rectilinear Distance / rank @@
+Normal rank
@@ Property / cites work @@
+On Some Distance Problems in Fixed Orientations
@@ Property / cites work: On Some Distance Problems in Fixed Orientations / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+How Long Can a Euclidean Traveling Salesman Tour Be?
+Normal rank
@@ Property / cites work @@
+Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
+Normal rank