A polynomial time approximation algorithm for the two-commodity splittable flow problem (Q2392809): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W35377302
@@ Property / OpenAlex ID: W35377302 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411349
@@ Property / cites work: Q4411349 / rank @@
+Normal rank
@@ Property / cites work @@
+The \(k\)-splittable flow problem
@@ Property / cites work: The \(k\)-splittable flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Multi-Commodity Network Flows
@@ Property / cites work: Multi-Commodity Network Flows / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank