Pages that link to "Item:Q4651489"
From MaRDI portal
The following pages link to Hardness of Approximation for Vertex-Connectivity Network Design Problems (Q4651489):
Displayed 20 items.
- Approximating minimum-cost edge-covers of crossing biset-families (Q397064) (← links)
- On the computational complexity of measuring global stability of banking networks (Q487019) (← links)
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
- Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752) (← links)
- Improved approximation algorithms for label cover problems (Q634686) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- A note on Rooted Survivable Networks (Q990935) (← links)
- Inapproximability of survivable networks (Q1019191) (← links)
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP (Q1709580) (← links)
- On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)
- Approximating subset \(k\)-connectivity problems (Q2376789) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319) (← links)
- An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788) (← links)
- Kernelization and complexity results for connectivity augmentation problems (Q3057175) (← links)
- New Results on the Complexity of the Max- and Min-Rep Problems (Q3075522) (← links)
- AN IMPLICIT COVER PROBLEM IN WILD POPULATION STUDY (Q3560058) (← links)
- On Approximating an Implicit Cover Problem in Biology (Q3638443) (← links)
- (Q5743436) (← links)
- (Q5743494) (← links)