Pages that link to "Item:Q5918432"
From MaRDI portal
The following pages link to A tight approximation algorithm for the cluster vertex deletion problem (Q5918432):
Displaying 8 items.
- Faster parameterized algorithm for cluster vertex deletion (Q2035480) (← links)
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684) (← links)
- On the \(d\)-claw vertex deletion problem (Q2695329) (← links)
- Kernelization through Tidying (Q3557047) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5918432) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
- A \(7 / 3\)-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams (Q6162034) (← links)
- On the parameterized complexity of s-club cluster deletion problems (Q6165557) (← links)