Pages that link to "Item:Q4806342"
From MaRDI portal
The following pages link to An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems (Q4806342):
Displaying 7 items.
- An inverse model for the most uniform problem (Q924880) (← links)
- Expanding maximum capacity path under weighted sum-type distances (Q2144881) (← links)
- On the optimum capacity of capacity expansion problems (Q2472185) (← links)
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm (Q2494305) (← links)
- A class of node based bottleneck improvement problems (Q2503225) (← links)
- Bottleneck capacity expansion problems with general budget constraints (Q2765595) (← links)
- A class of bottleneck expansion problems (Q5936134) (← links)