On fixed cost \(k\)-flow problems (Q260248): Difference between revisions

@@ Property / cites work @@
+Generalized submodular cover problems and applications
+Normal rank
@@ Property / cites work @@
+Q4542533
@@ Property / cites work: Q4542533 / rank @@
+Normal rank
@@ Property / cites work @@
+The polymatroid Steiner problems
@@ Property / cites work: The polymatroid Steiner problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952606
@@ Property / cites work: Q4952606 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability of Capacitated Network Design
@@ Property / cites work: Approximability of Capacitated Network Design / rank @@
+Normal rank
@@ Property / cites work @@
+Capacitated Network Design on Undirected Graphs
@@ Property / cites work: Capacitated Network Design on Undirected Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A greedy approximation algorithm for the group Steiner problem
+Normal rank
@@ Property / cites work @@
+On network design problems: fixed cost flows and the covering steiner problem
+Normal rank
@@ Property / cites work @@
+A tight bound on approximating arbitrary metrics by tree metrics
+Normal rank
@@ Property / cites work @@
+A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
+Normal rank
@@ Property / cites work @@
+The minimum shift design problem
@@ Property / cites work: The minimum shift design problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128880
@@ Property / cites work: Q3128880 / rank @@
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Polylogarithmic inapproximability
@@ Property / cites work: Polylogarithmic inapproximability / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of the greedy algorithm for the submodular set covering problem
+Normal rank
@@ Property / cites work @@
+Q4828915
@@ Property / cites work: Q4828915 / rank @@
+Normal rank