On approximation algorithms for the terminal Steiner tree problem (Q1029037): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2003.09.014
@@ Property / DOI: 10.1016/j.ipl.2003.09.014 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2003.09.014
+Normal rank
@@ Property / OpenAlex ID @@
+W1980288485
@@ Property / OpenAlex ID: W1980288485 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+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 Full and Bottleneck Full Steiner Tree Problems
+Normal rank
@@ Property / cites work @@
+Q3046489
@@ Property / cites work: Q3046489 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem
@@ Property / cites work: The 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 @@
+Q4952699
@@ Property / cites work: Q4952699 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2003.09.014
@@ Property / DOI: 10.1016/J.IPL.2003.09.014 / rank @@
+Normal rank