A tight approximation algorithm for the cluster vertex deletion problem (Q5925651): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-021-01744-w
+Normal rank
@@ Property / OpenAlex ID @@
+W3042827292
@@ Property / OpenAlex ID: W3042827292 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2798999
@@ Property / cites work: Q2798999 / rank @@
+Normal rank
@@ Property / cites work @@
+Extended formulations for matroid polytopes through randomized protocols
+Normal rank
@@ Property / cites work @@
+Graph fragmentation problem: analysis and synthesis
+Normal rank
@@ Property / cites work @@
+A tight approximation algorithm for the cluster vertex deletion problem
+Normal rank
@@ Property / cites work @@
+Extended formulations from communication protocols in output-efficient time
+Normal rank
@@ Property / cites work @@
+Extension complexity of stable set polytopes of bipartite graphs
+Normal rank
@@ Property / cites work @@
+No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i>
+Normal rank
@@ Property / cites work @@
+Q4288578
@@ Property / cites work: Q4288578 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast branching algorithm for cluster vertex deletion
+Normal rank
@@ Property / cites work @@
+Strong reductions for extended formulations
@@ Property / cites work: Strong reductions for extended formulations / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of Combinatorial Problems via Small LPs and SDPs
+Normal rank
@@ Property / cites work @@
+An Approximation Algorithm for Feedback Vertex Sets in Tournaments
+Normal rank
@@ Property / cites work @@
+Vertex deletion problems on chordal graphs
@@ Property / cites work: Vertex deletion problems on chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Constraint Satisfaction Requires Large LP Relaxations
+Normal rank
@@ Property / cites work @@
+Integer Programming
@@ Property / cites work: Integer Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for hitting 3-vertex paths
+Normal rank
@@ Property / cites work @@
+Exact Algorithms via Monotone Local Search
@@ Property / cites work: Exact Algorithms via Monotone Local Search / rank @@
+Normal rank
@@ Property / cites work @@
+Subquadratic Kernels for Implicit 3-H             <scp>itting</scp>             S             <scp>et</scp>             and 3-S             <scp>et</scp>             P             <scp>acking</scp>             Problems
+Normal rank
@@ Property / cites work @@
+Polyhedral properties of the induced cluster subgraphs
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for cluster vertex deletion
+Normal rank
@@ Property / cites work @@
+Analysis of complex network performance and heuristic node removal strategies
+Normal rank
@@ Property / cites work @@
+Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs
+Normal rank
@@ Property / cites work @@
+A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
+Normal rank
@@ Property / cites work @@
+-Approximating Feedback Vertex Set in Tournaments
+Normal rank
@@ Property / cites work @@
+A 7/3-Approximation for Feedback Vertex Sets in Tournaments
+Normal rank
@@ Property / cites work @@
+Q4221106
@@ Property / cites work: Q4221106 / rank @@
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank
@@ Property / cites work @@
+Decomposition by clique separators
@@ Property / cites work: Decomposition by clique separators / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+Q3386630
@@ Property / cites work: Q3386630 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate association via dissociation
@@ Property / cites work: Approximate association via dissociation / rank @@
+Normal rank