Pages that link to "Item:Q5918432"

The following pages link to A tight approximation algorithm for the cluster vertex deletion problem (Q5918432):

Displaying 4 items.

• A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684) (← 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)