Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges
From MaRDI portal
Publication:2672432
DOI10.1007/978-3-030-86838-3_11OpenAlexW3201949770MaRDI QIDQ2672432
Niels Grüttemeier, Nils Morawietz, Frank Sommer, Christian Komusiewicz
Publication date: 8 June 2022
Full work available at URL: https://arxiv.org/abs/2107.04482
Related Items (1)
Cites Work
- Parameterized complexity of the \(k\)-arc Chinese postman problem
- Fundamentals of parameterized complexity
- Matching interdiction
- Treewidth. Computations and approximations
- Deterministic network interdiction
- Bin packing with fixed number of bins revisited
- Stochastic Network Interdiction
- Parameterized Complexity of Edge Interdiction Problems
- Finding small separators in linear time via treewidth reduction
- Length-bounded cuts and flows
- Fractals for Kernelization Lower Bounds
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths
- Hardness and approximation for network flow interdiction
- Shortest-path network interdiction
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
This page was built for publication: Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges
