Pages that link to "Item:Q2638376"
From MaRDI portal
The following pages link to Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376):
Displaying 21 items.
- Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network (Q320688) (← links)
- An extended network interdiction problem for optimal toll control (Q325471) (← links)
- A measure-theoretical max-flow-min-cut problem (Q583082) (← links)
- Recognizing max-flow min-cut path matrices (Q1103514) (← links)
- Margin of victory for tournament solutions (Q2060724) (← links)
- Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- Edge degeneracy: algorithmic and structural results (Q2196572) (← links)
- Complexity and approximability of the maximum flow problem with minimum quantities (Q2811300) (← links)
- Length-bounded cuts and flows (Q3188986) (← links)
- Length-Bounded Cuts and Flows (Q3613800) (← links)
- An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs (Q4015475) (← links)
- On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663) (← links)
- An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications (Q4806910) (← links)
- On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow (Q5119381) (← links)
- Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
- Flows on few paths: Algorithms and lower bounds (Q5487813) (← links)
- (Q6084397) (← links)
- (Q6087208) (← links)
- Network design with vulnerability constraints and probabilistic edge reliability (Q6599059) (← links)
