A note on the subadditive network design problem (Q1038103): Difference between revisions

@@ Property / cites work @@
+Q2921761
@@ Property / cites work: Q2921761 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4763416
@@ Property / cites work: Q4763416 / rank @@
+Normal rank
@@ Property / cites work @@
+The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
+Normal rank
@@ Property / cites work @@
+Stochastic Steiner Tree with Non-uniform Inflation
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating spanners
@@ Property / cites work: On the hardness of approximating spanners / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating label-cover
@@ Property / cites work: On the hardness of approximating label-cover / rank @@
+Normal rank
@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+Q4234093
@@ Property / cites work: Q4234093 / rank @@
+Normal rank
@@ Property / cites work @@
+A constant factor approximation for the single sink edge installation problems
+Normal rank
@@ Property / cites work @@
+Simpler and better approximation algorithms for network design
+Normal rank
@@ Property / cites work @@
+A tight bound on approximating arbitrary metrics by tree metrics
+Normal rank
@@ Property / cites work @@
+Q2768295
@@ Property / cites work: Q2768295 / rank @@
+Normal rank