Pages that link to "Item:Q5167793"

The following pages link to Parameterized Algorithms to Preserve Connectivity (Q5167793):

Displaying 18 items.

• Path-contractions, edge deletions and connectivity preservation (Q1713475) (← links)
• Approximation algorithms for vertex-connectivity augmentation on the cycle (Q2085731) (← links)
• Approximation algorithms for connectivity augmentation problems (Q2117100) (← links)
• 2-node-connectivity network design (Q2117701) (← links)
• On the fixed-parameter tractability of the maximum connectivity improvement problem (Q2195571) (← links)
• On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
• A polylogarithmic approximation algorithm for 2-edge-connected dominating set (Q2234806) (← links)
• Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q3448810) (← links)
• Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
• Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q4619482) (← links)
• Path-Contractions, Edge Deletions and Connectivity Preservation (Q5111736) (← links)
• Fast exact algorithms for survivable network design with uniform requirements (Q5918784) (← links)
• Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
• 2-node-connectivity network design (Q6122594) (← links)
• Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
• Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation (Q6608041) (← links)
• Approximation algorithms for node and element connectivity augmentation problems (Q6635706) (← links)