Pages that link to "Item:Q4474300"
From MaRDI portal
The following pages link to Algorithms for a network design problem with crossing supermodular demands (Q4474300):
Displayed 6 items.
- Approximating directed weighted-degree constrained networks (Q627195) (← links)
- LP-based solution methods for the asymmetric TSP (Q845937) (← links)
- On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs (Q877196) (← links)
- The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
- Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092) (← links)
- Approximating Directed Weighted-Degree Constrained Networks (Q3541798) (← links)