A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190): Difference between revisions

@@ Property / cites work @@
+Q4763418
@@ Property / cites work: Q4763418 / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Several Graph Augmentation Problems
+Normal rank
@@ Property / cites work @@
+Q4234132
@@ Property / cites work: Q4234132 / rank @@
+Normal rank
@@ Property / cites work @@
+Survivable networks, linear programming relaxations and the parsimonious property
+Normal rank
@@ Property / cites work @@
+Q3128880
@@ Property / cites work: Q3128880 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4763416
@@ Property / cites work: Q4763416 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast approximation algorithm for the multicovering problem
+Normal rank
@@ Property / cites work @@
+Q4234131
@@ Property / cites work: Q4234131 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+An 11/6-approximation algorithm for the network Steiner problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01299747
+Normal rank
@@ Property / OpenAlex ID @@
+W4385007144
@@ Property / OpenAlex ID: W4385007144 / rank @@
+Normal rank