Pages that link to "Item:Q5248542"
From MaRDI portal
The following pages link to A primal-dual approximation algorithm for generalized Steiner network problems (Q5248542):
Displayed 9 items.
- Linear bounds for on-line Steiner problems (Q672394) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- Eisenberg-Gale markets: algorithms and game-theoretic properties (Q993788) (← links)
- The parsimonious property of cut covering problems and its applications (Q1375118) (← links)
- Rounding algorithms for covering problems (Q1380937) (← links)
- Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
- Network flow spanners (Q3057178) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249) (← links)
- Approximation Algorithms for a Network Design Problem (Q5323067) (← links)