Maximum edge-disjoint paths in planar graphs with congestion 2 (Q2039241): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-020-01513-1
+Normal rank
@@ Property / OpenAlex ID @@
+W3028209208
@@ Property / OpenAlex ID: W3028209208 / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
+Normal rank
@@ Property / cites work @@
+Edge-disjoint paths in Planar graphs with constant congestion
+Normal rank
@@ Property / cites work @@
+Maximum Edge-Disjoint Paths in k-Sums of Graphs
@@ Property / cites work: Maximum Edge-Disjoint Paths in k-Sums of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+(Almost) Tight bounds and existence theorems for single-commodity confluent flows
+Normal rank
@@ Property / cites work @@
+Routing in undirected graphs with constant congestion
+Normal rank
@@ Property / cites work @@
+New hardness results for routing on disjoint paths
+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 @@
+Degree-constrained network flows
@@ Property / cites work: Degree-constrained network flows / rank @@
+Normal rank
@@ Property / cites work @@
+Q3085455
@@ Property / cites work: Q3085455 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
+Normal rank
@@ Property / cites work @@
+All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs
+Normal rank
@@ Property / cites work @@
+Q4234048
@@ Property / cites work: Q4234048 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity flows in planar graphs
@@ Property / cites work: Multicommodity flows in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized rounding: A technique for provably good algorithms and algorithmic proofs
+Normal rank
@@ Property / cites work @@
+Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2
+Normal rank