Algorithms for terminal Steiner trees (Q2465633): 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.1016/j.tcs.2007.08.001
+Normal rank
@@ Property / OpenAlex ID @@
+W1989076933
@@ Property / OpenAlex ID: W1989076933 / rank @@
+Normal rank
@@ Property / cites work @@
+Tighter Bounds for Graph Steiner Tree Approximation
+Normal rank
@@ Property / cites work @@
+The full Steiner tree problem
@@ Property / cites work: The full Steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+On approximation algorithms for the terminal Steiner tree problem
+Normal rank
@@ Property / cites work @@
+A note on the terminal Steiner tree problem
@@ Property / cites work: A note on the terminal Steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the terminal Steiner tree problem.
@@ Property / cites work: On the terminal Steiner tree problem. / rank @@
+Normal rank
@@ Property / cites work @@
+On the Full and Bottleneck Full Steiner Tree Problems
+Normal rank
@@ Property / cites work @@
+The Steiner problem with edge lengths 1 and 2
@@ Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
+Normal rank