Pages that link to "Item:Q4907576"

The following pages link to An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem (Q4907576):

Displayed 9 items.

• An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) ‎ (← links)
• Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) ‎ (← links)
• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) ‎ (← links)
• A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) ‎ (← links)
• Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) ‎ (← links)
• Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) ‎ (← links)
• (Q5874542) ‎ (← links)
• Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) ‎ (← links)
• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) ‎ (← links)