The parameterized complexity landscape of the unsplittable flow problem
From MaRDI portal
Cites work
- A (1+)-approximation for unsplittable flow on a path in fixed-parameter running time
- A c^k n 5-approximation algorithm for treewidth
- A constant factor approximation algorithm for unsplittable flow on paths
- A constant-factor approximation algorithm for unsplittable flow on paths
- A mazing \(2+\epsilon\) approximation for unsplittable flow on a path
- A PTAS for unsplittable flow on a path
- A single-exponential time 2-approximation algorithm for treewidth
- Algorithmic applications of tree-cut width
- An improved approximation algorithm for \textsc{Resource Allocation}
- Approximation algorithms for disjoint paths and related routing and packing problems
- Bin packing with fixed number of bins revisited
- Caching is hard -- even in the fault model
- Computing twin-width parameterized by the feedback edge number
- Eulerian disjoint paths problem in grid graphs is NP-complete
- Faster (1+µ)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back
- FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees
- Fundamentals of parameterized complexity
- Graph minors. II. Algorithmic aspects of tree-width
- scientific article; zbMATH DE number 1445390 (Why is no real title available?)
- Immersions in highly edge connected graphs
- Improved bounds for the unsplittable flow problem
- Multicommodity demand flow in a tree and packing integer programs
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- New algorithms for maximum disjoint paths based on tree-likeness
- New approximation schemes for unsplittable flow on a path
- On structural parameterizations of the edge disjoint paths problem
- Parameterized algorithms
- Parameterized algorithms for book embedding problems
- Parameterized algorithms for upward planarity
- Parameterized complexity of binary CSP: vertex cover, treedepth, and related parameters
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Slim tree-cut width
- Sparsity. Graphs, structures, and algorithms
- Submodular unsplittable flow on trees
- The complexity of binary matrix completion under diameter constraints
- The parameterized complexity of coordinated motion planning
- The power of cut-based parameters for computing edge-disjoint paths
- The structure of graphs not admitting a fixed immersion
- To augment or not to augment: solving unsplittable flow on a path by creating slack
- Treewidth. Computations and approximations
- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
- Unsplittable flow on a path: the game!
This page was built for publication: The parameterized complexity landscape of the unsplittable flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988717)
