An average case analysis of a greedy algorithm for the on-line Steiner tree problem (Q1921250): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0898-1221(96)00069-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2118742652
@@ Property / OpenAlex ID: W2118742652 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Steiner Tree Problem
@@ Property / cites work: Dynamic Steiner Tree Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms
+Normal rank
@@ Property / cites work @@
+An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
+Normal rank
@@ Property / cites work @@
+An upper bound for the average length of the euclidean minimum spanning tree
+Normal rank
@@ Property / cites work @@
+A proof of the Gilbert-Pollak conjecture on the Steiner ratio
+Normal rank
@@ Property / cites work @@
+Q5586854
@@ Property / cites work: Q5586854 / rank @@
+Normal rank