Pages that link to "Item:Q858116"
From MaRDI portal
The following pages link to Network design via iterative rounding of setpair relaxations (Q858116):
Displayed 11 items.
- Degree constrained node-connectivity problems (Q486998) (← links)
- A unified algorithm for degree bounded survivable network design (Q896300) (← links)
- Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation (Q2804546) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- On Element-Connectivity Preserving Graph Simplification (Q3452796) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- (Q5240415) (← links)
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)
- Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity (Q5883291) (← links)