Pages that link to "Item:Q2921713"

The following pages link to Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding (Q2921713):

Displaying 8 items.

• On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs (Q877196) (← links)
• An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph (Q2656340) (← links)
• Iterated rounding algorithms for the smallest \(k\)-edge connected spanning subgraph (Q2884575) (← links)
• (Q2969610) (← links)
• Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092) (← links)
• Network flow spanners (Q3057178) (← links)
• Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees (Q3602825) (← links)
• Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching (Q4507363) (← links)