Minimum-cost single-source 2-splittable flow (Q1041715): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2004.12.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2107700597
@@ Property / OpenAlex ID: W2107700597 / rank @@
+Normal rank
@@ Property / cites work @@
+On the single-source unsplittable flow problem
@@ Property / cites work: On the single-source unsplittable flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Single-Source Unsplittable Flow
+Normal rank
@@ Property / cites work @@
+Approximating disjoint-path problems using packing integer programs
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+Approximating the single source unsplittable min-cost flow problem
+Normal rank