On the approximation of the single source \(k\)-splittable flow problem (Q935843): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2007.03.001
+Normal rank
@@ Property / OpenAlex ID @@
+W1991111061
@@ Property / OpenAlex ID: W1991111061 / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness of the undirected congestion minimization problem
+Normal rank
@@ Property / cites work @@
+The \(k\)-splittable flow problem
@@ Property / cites work: The \(k\)-splittable flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+New hardness results for congestion minimization and machine scheduling
+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 @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263722
@@ Property / cites work: Q4263722 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-cost single-source 2-splittable flow
@@ Property / cites work: Minimum-cost single-source 2-splittable flow / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the single source unsplittable min-cost flow problem
+Normal rank