On approximating node-disjoint paths in grids
From MaRDI portal
Recommendations
- Improved approximation for node-disjoint paths in grids with sources on the boundary
- Improved approximation for node-disjoint paths in planar graphs
- New hardness results for routing on disjoint paths
- New hardness results for routing on disjoint paths
- Almost polynomial hardness of node-disjoint paths in grids
Cited in
(22)- A note on solving the fleet quickest routing problem on a grid graph
- scientific article; zbMATH DE number 4205963 (Why is no real title available?)
- New hardness results for routing on disjoint paths
- All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs
- scientific article; zbMATH DE number 1445371 (Why is no real title available?)
- On the number of shortest paths by neighborhood sequences on the square grid
- New hardness results for routing on disjoint paths
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
- Improved approximation for node-disjoint paths in grids with sources on the boundary
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments
- Almost polynomial hardness of node-disjoint paths in grids
- Almost polynomial hardness of node-disjoint paths in grids
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
- Improved approximation for node-disjoint paths in planar graphs
- Poly-logarithmic approximation for maximum node disjoint paths with constant congestion
- Kernels for the disjoint paths problem on subclasses of chordal graphs
- Kernels for the disjoint paths problem on subclasses of chordal graphs
- An exponential time parameterized algorithm for planar disjoint paths
- Loss minimization for electrical flows over spanning trees on grids
- Parameterized maximum node-disjoint paths
- The parameterized complexity of coordinated motion planning
This page was built for publication: On approximating node-disjoint paths in grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5351898)
