Pages that link to "Item:Q2884575"
From MaRDI portal
The following pages link to Iterated rounding algorithms for the smallest \(k\)-edge connected spanning subgraph (Q2884575):
Displaying 10 items.
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs (Q1941534) (← links)
- Flexible graph connectivity (Q2118137) (← links)
- An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph (Q2656340) (← links)
- Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding (Q2921713) (← links)
- Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092) (← links)
- Flexible Graph Connectivity (Q5041731) (← links)
- Approximation algorithms for flexible graph connectivity (Q6120848) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)
- Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions (Q6586662) (← links)