scientific article; zbMATH DE number 7278041
From MaRDI portal
Publication:5136255
Recommendations
- On structural parameterizations of the edge disjoint paths problem
- Parameterized tractability of edge-disjoint paths on directed acyclic graphs
- Parameterized tractability of edge-disjoint paths on directed acyclic graphs
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- On the complexity of the planar directed edge-disjoint paths problem
- Edge-disjoint paths revisited
- scientific article; zbMATH DE number 2079393
- The power of cut-based parameters for computing edge-disjoint paths
- NP-completeness of some edge-disjoint paths problems
Cites work
- A c^k n 5-approximation algorithm for treewidth
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A logical approach to multicut problems
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
- Approximating disjoint-path problems using packing integer programs
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Finding edge-disjoint paths in partial \(k\)-trees
- Fundamentals of parameterized complexity
- Graph minors. XIII: The disjoint paths problem
- scientific article; zbMATH DE number 5899246 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- New algorithms for maximum disjoint paths based on tree-likeness
- NP-completeness of some edge-disjoint paths problems
- On routing disjoint paths in bounded treewidth graphs
- On the Computational Complexity of Combinatorial Problems
- Parameterized algorithms
- Parametrized complexity theory.
- Primal-dual approximation algorithms for integral flow and multicut in trees
- The edge-disjoint paths problem is NP-complete for series-parallel graphs
- Treewidth. Computations and approximations
Cited in
(6)- On structural parameterizations of the edge disjoint paths problem
- The power of cut-based parameters for computing edge disjoint paths
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope
- The power of cut-based parameters for computing edge-disjoint paths
- Group activity selection with few agent types
- The complexity of optimizing atomic congestion
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136255)
