Pages that link to "Item:Q3304128"
From MaRDI portal
The following pages link to Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128):
Displaying 11 items.
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- (Q5075825) (← links)
- (Q5090497) (← links)
- On the Parameterized Complexity of [1,j]-Domination Problems (Q5090974) (← links)
- (Q6089671) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
