Primal-dual approximation algorithms for the prize-collecting Steiner tree problem (Q2379971): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2007.03.012
@@ Property / DOI: 10.1016/j.ipl.2007.03.012 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2007.03.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2099618932
@@ Property / OpenAlex ID: W2099618932 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation
+Normal rank
@@ Property / cites work @@
+Q2768267
@@ Property / cites work: Q2768267 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient approximation algorithm for the survivable network design problem
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952698
@@ Property / cites work: Q4952698 / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for bicategories, with application to speeding up an approximation algorithm
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2007.03.012
@@ Property / DOI: 10.1016/J.IPL.2007.03.012 / rank @@
+Normal rank