New algorithms for maximum disjoint paths based on tree-likeness (Q1785205): Difference between revisions

@@ Property / OpenAlex ID @@
+W2885925565
@@ Property / OpenAlex ID: W2885925565 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.01740
@@ Property / arXiv ID: 1603.01740 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Bounds for Linkages in Planar Graphs
@@ Property / cites work: Tight Bounds for Linkages in Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886092
@@ Property / cites work: Q4886092 / rank @@
+Normal rank
@@ Property / cites work @@
+An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
+Normal rank
@@ Property / cites work @@
+A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
+Normal rank
@@ Property / cites work @@
+Kernel bounds for disjoint cycles and disjoint paths
+Normal rank
@@ Property / cites work @@
+Optimal Construction of Edge-Disjoint Paths in Random Graphs
+Normal rank
@@ Property / cites work @@
+Existence and Construction of Edge-Disjoint Paths on Expander Graphs
+Normal rank
@@ Property / cites work @@
+Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion
+Normal rank
@@ Property / cites work @@
+Q3002769
@@ Property / cites work: Q3002769 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on multiflows and treewidth
@@ Property / cites work: A note on multiflows and treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity demand flow in a tree and packing integer programs
+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 @@
+Flow-cut gaps for integer and fractional multiflows
+Normal rank
@@ Property / cites work @@
+Routing in undirected graphs with constant congestion
+Normal rank
@@ Property / cites work @@
+Improved approximation for node-disjoint paths in planar graphs
+Normal rank
@@ Property / cites work @@
+New hardness results for routing on disjoint paths
+Normal rank
@@ Property / cites work @@
+On Routing Disjoint Paths in Bounded Treewidth Graphs
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Paths in Expander Graphs
@@ Property / cites work: Edge-Disjoint Paths in Expander Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+A New Min‐Cut Max‐Flow Ratio for Multicommodity Flows
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+A shorter proof of the graph minor algorithm
@@ Property / cites work: A shorter proof of the graph minor algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs
+Normal rank
@@ Property / cites work @@
+Q4231910
@@ Property / cites work: Q4231910 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations for the disjoint paths problem in high-diameter planar networks
+Normal rank
@@ Property / cites work @@
+Approximating disjoint-path problems using packing integer programs
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+The geometry of graphs and some of its algorithmic applications
+Normal rank
@@ Property / cites work @@
+Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
+Normal rank
@@ Property / cites work @@
+The edge-disjoint paths problem is NP-complete for series-parallel graphs
+Normal rank
@@ Property / cites work @@
+Randomized rounding: A technique for provably good algorithms and algorithmic proofs
+Normal rank
@@ Property / cites work @@
+Edge Disjoint Paths in Moderately Connected Graphs
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2
+Normal rank