Routing in Undirected Graphs with Constant Congestion (Q2817791): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2515641369
@@ Property / OpenAlex ID: W2515641369 / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
+Normal rank
@@ Property / cites work @@
+Hardness of the undirected edge-disjoint paths problem
+Normal rank
@@ Property / cites work @@
+Hardness of the Undirected Congestion Minimization Problem
+Normal rank
@@ Property / cites work @@
+Almost-tight hardness of directed congestion minimization
+Normal rank
@@ Property / cites work @@
+Expander flows, geometric embeddings and graph partitioning
+Normal rank
@@ Property / cites work @@
+Combinatorial algorithms for the unsplittable flow problem
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
+Normal rank
@@ Property / cites work @@
+Q3128923
@@ Property / cites work: Q3128923 / rank @@
+Normal rank
@@ Property / cites work @@
+Existence and Construction of Edge-Disjoint Paths on Expander Graphs
+Normal rank
@@ Property / cites work @@
+Large-treewidth graph decompositions and applications
+Normal rank
@@ Property / cites work @@
+Polynomial bounds for the grid-minor theorem
@@ Property / cites work: Polynomial bounds for the grid-minor theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Degree-3 Treewidth Sparsifiers
@@ Property / cites work: Degree-3 Treewidth Sparsifiers / rank @@
+Normal rank
@@ Property / cites work @@
+Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion
+Normal rank
@@ Property / cites work @@
+Q4471352
@@ Property / cites work: Q4471352 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity flow, well-linked terminals, and routing problems
+Normal rank
@@ Property / cites work @@
+Q3002769
@@ Property / cites work: Q3002769 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Paths in Planar Graphs with Constant Congestion
+Normal rank
@@ Property / cites work @@
+The All-or-Nothing Multicommodity Flow Problem
@@ Property / cites work: The All-or-Nothing Multicommodity Flow Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity demand flow in a tree and packing integer programs
+Normal rank
@@ Property / cites work @@
+On vertex sparsifiers with Steiner nodes
@@ Property / cites work: On vertex sparsifiers with Steiner nodes / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549611
@@ Property / cites work: Q3549611 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
+Normal rank
@@ Property / cites work @@
+Concentration of Measure for the Analysis of Randomized Algorithms
+Normal rank
@@ Property / cites work @@
+Vertex Sparsifiers: New Results from Old Techniques
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Edge-disjoint paths in planar graphs
@@ Property / cites work: Edge-disjoint paths in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3828033
@@ Property / cites work: Q3828033 / rank @@
+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 @@
+Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
+Normal rank
@@ Property / cites work @@
+Q5620621
@@ Property / cites work: Q5620621 / rank @@
+Normal rank
@@ Property / cites work @@
+Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
+Normal rank
@@ Property / cites work @@
+Random Sampling in Cut, Flow, and Network Design Problems
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Breaking o(n             <sup>1/2</sup>             )-approximation algorithms for the edge-disjoint paths problem with congestion two
+Normal rank
@@ Property / cites work @@
+An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs
+Normal rank
@@ Property / cites work @@
+Graph partitioning using single commodity flows
@@ Property / cites work: Graph partitioning using single commodity flows / 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 @@
+Extensions and limits to vertex sparsification
@@ Property / cites work: Extensions and limits to vertex sparsification / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+A Reduction Method for Edge-Connectivity in Graphs
+Normal rank
@@ Property / cites work @@
+Metric extension operators, vertex sparsifiers and Lipschitz extendability
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
+Normal rank
@@ Property / cites work @@
+A constructive proof of the general lovász local lemma
+Normal rank
@@ Property / cites work @@
+Q3549733
@@ Property / cites work: Q3549733 / rank @@
+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 @@
+Q3972953
@@ Property / cites work: Q3972953 / rank @@
+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
@@ Property / cites work @@
+Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
+Normal rank
@@ Property / cites work @@
+Q5501283
@@ Property / cites work: Q5501283 / rank @@
+Normal rank