2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2026
Cluster Deletion is as Hard to Approximate as Vertex Cover
Yixin Cao, Ying Xu
Recent breakthroughs in Cluster Editing have motivated attempts to adapt these approaches to obtain better-than- approximations for Cluster Deletion. We rule out this possibilit…
cs.DS2024★ 2 cited
Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
Vicente Balmaseda, Ying Xu, Yixin Cao +1
Cluster deletion is an NP-hard graph clustering objective with applications in computational biology and social network analysis, where the goal is to delete a minimum number of ed…