Pages that link to "Item:Q1179737"
From MaRDI portal
The following pages link to Ancestor tree for arbitrary multi-terminal cut functions (Q1179737):
Displaying 9 items.
- A note on minimizing submodular functions (Q293366) (← links)
- Flow trees for vertex-capacitated networks (Q869579) (← links)
- Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346) (← links)
- Dynamic programming and graph optimization problems (Q1327180) (← links)
- Reconstructing edge-disjoint paths faster (Q1785736) (← links)
- A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks (Q2267666) (← links)
- The multi-layered network design problem (Q2370332) (← links)
- An algorithm for computing maximum solution bases (Q2641220) (← links)
- Tight Bounds for Gomory-Hu-like Cut Counting (Q3181053) (← links)
