Pages that link to "Item:Q2933629"

The following pages link to Approximating minimum-cost connectivity problems via uncrossable bifamilies (Q2933629):

Displaying 20 items.

• An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
• Approximating source location and star survivable network problems (Q528470) (← links)
• Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
• Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
• A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems (Q1730018) (← links)
• Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
• Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
• Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (Q1799605) (← links)
• Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
• Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
• A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
• Approximating Source Location and Star Survivable Network Problems (Q2827812) (← links)
• Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
• Spider Covering Algorithms for Network Design Problems (Q4689626) (← links)
• (Q5009500) (← links)
• Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
• Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
• Approximating k-Connected m-Dominating Sets (Q5874545) (← links)
• Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
• The parameterized complexity of the survivable network design problem (Q6655676) (← links)