The following pages link to Length-Bounded Cuts and Flows (Q3613800):
Displaying 11 items.
- An extended network interdiction problem for optimal toll control (Q325471) (← links)
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- Flows with unit path capacities and related packing and covering problems (Q1041430) (← links)
- Edge degeneracy: algorithmic and structural results (Q2196572) (← links)
- Approximability of the firefighter problem. Computing cuts over time (Q2428668) (← links)
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) (← links)
- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms (Q3656863) (← links)
- Rerouting Flows when Links Fail (Q5128505) (← links)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
- (Q5240194) (← links)
- Searching for a Visible, Lazy Fugitive (Q5302068) (← links)
