Greedy algorithms for the on-line steiner tree and generalized steiner problems (Q5060154): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-57155-8_285
+Normal rank
@@ Property / OpenAlex ID @@
+W1594159683
@@ Property / OpenAlex ID: W1594159683 / rank @@
+Normal rank
@@ Property / cites work @@
+On Steiner trees for bounded point sets
@@ Property / cites work: On Steiner trees for bounded point sets / 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 @@
+Dynamic Steiner Tree Problem
@@ Property / cites work: Dynamic Steiner Tree Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3760270
@@ Property / cites work: Q3760270 / rank @@
+Normal rank
@@ Property / cites work @@
+Cost-minimal trees in directed acyclic graphs
@@ Property / cites work: Cost-minimal trees in directed acyclic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner problem in networks: A survey
@@ Property / cites work: Steiner problem in networks: A survey / rank @@
+Normal rank