On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow
From MaRDI portal
Publication:5119381
DOI10.7155/jgaa.00534zbMath1447.05192arXiv1902.07568OpenAlexW3035852163MaRDI QIDQ5119381
Kateřina Altmanová, Jan Voborník, Petr Kolman
Publication date: 4 September 2020
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.07568
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- On the complexity of vertex-disjoint length-restricted path problems
- Notes on polyhedra associated with hop-constrained paths
- On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
- Parametrized Complexity of Length-Bounded Cuts and Multi-cuts
- Length-bounded cuts and flows
- Improved bounds for the unsplittable flow problem
- Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems
- Approximation Schemes for the Restricted Shortest Path Problem
- Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems
- Fractals for Kernelization Lower Bounds
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths
- On Algorithms Employing Treewidth for $L$-bounded Cut Problems
- The complexity of finding maximum disjoint paths with length constraints
- Improved Hardness for Cut, Interdiction, and Firefighter Problems
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- A simple efficient approximation scheme for the restricted shortest path problem
This page was built for publication: On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow
