Pages that link to "Item:Q5348212"
From MaRDI portal
The following pages link to Inapproximability of $H$-Transversal/Packing (Q5348212):
Displaying 9 items.
- Approximation algorithms for hitting subgraphs (Q2115875) (← links)
- Improved approximation algorithms for hitting 3-vertex paths (Q2191773) (← links)
- Approximation algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
- Strong hardness of approximation for tree transversals (Q2681395) (← links)
- On the \(d\)-claw vertex deletion problem (Q2695329) (← links)
- (Q5075776) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
- On the \(d\)-claw vertex deletion problem (Q6182678) (← links)
- Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs (Q6620013) (← links)