Pages that link to "Item:Q1635806"
From MaRDI portal
The following pages link to Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806):
Displaying 11 items.
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116) (← links)
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (Q1799605) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- On the fixed-parameter tractability of the maximum connectivity improvement problem (Q2195571) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems (Q3125225) (← links)
- Approximating Minimum Cost Connectivity Orientation and Augmentation (Q4606698) (← links)
- Minimum Cardinality Point-to-point Connectivity Augmentation Problem (Q4692118) (← links)
- Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation (Q4962187) (← links)
