Approximating Bounded Degree Deletion via Matroid Matching (Q5283370): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-57586-5_20
+Normal rank
@@ Property / OpenAlex ID @@
+W2606695133
@@ Property / OpenAlex ID: W2606695133 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem
+Normal rank
@@ Property / cites work @@
+On bounded-degree vertex deletion parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+On the vertex \(k\)-path cover
@@ Property / cites work: On the vertex \(k\)-path cover / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum \(k\)-path vertex cover
@@ Property / cites work: Minimum \(k\)-path vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+On the weighted \(k\)-path vertex cover problem
@@ Property / cites work: On the weighted \(k\)-path vertex cover problem / rank @@
+Normal rank
@@ Property / cites work @@
+Random pseudo-polynomial algorithms for exact matroid problems
+Normal rank
@@ Property / cites work @@
+A Linear Kernel for Co-Path/Cycle Packing
@@ Property / cites work: A Linear Kernel for Co-Path/Cycle Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+A generalization of Nemhauser and Trotter's local optimization theorem
+Normal rank
@@ Property / cites work @@
+Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems
+Normal rank
@@ Property / cites work @@
+A unified approximation algorithm for node-deletion problems
+Normal rank
@@ Property / cites work @@
+Approximating Node-Deletion Problems for Matroidal Properties
+Normal rank
@@ Property / cites work @@
+On approximation of the submodular set cover problem
+Normal rank
@@ Property / cites work @@
+On the \(k\)-path vertex cover of some graph products
+Normal rank
@@ Property / cites work @@
+Q4119222
@@ Property / cites work: Q4119222 / rank @@
+Normal rank
@@ Property / cites work @@
+A better approximation ratio for the vertex cover problem
+Normal rank
@@ Property / cites work @@
+On computing the minimum 3-path vertex cover and dissociation number of graphs
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Matroid Matching: The Power of Local Search
@@ Property / cites work: Matroid Matching: The Power of Local Search / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Matroid matching and some applications
@@ Property / cites work: Matroid matching and some applications / rank @@
+Normal rank
@@ Property / cites work @@
+Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
+Normal rank
@@ Property / cites work @@
+Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees
+Normal rank
@@ Property / cites work @@
+Every Property of Hyperfinite Graphs Is Testable
@@ Property / cites work: Every Property of Hyperfinite Graphs Is Testable / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach for approximating node deletion problems
+Normal rank
@@ Property / cites work @@
+The complexity of dissociation set problems in graphs
+Normal rank
@@ Property / cites work @@
+A graph‐theoretic generalization of the clique concept
+Normal rank
@@ Property / cites work @@
+A fixed-parameter algorithm for the vertex cover \(P_3\) problem
+Normal rank
@@ Property / cites work @@
+The vertex cover \(P_3\) problem in cubic graphs
@@ Property / cites work: The vertex cover \(P_3\) problem in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
+Normal rank
@@ Property / cites work @@
+A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
+Normal rank
@@ Property / cites work @@
+An analysis of the greedy algorithm for the submodular set covering problem
+Normal rank
@@ Property / cites work @@
+On a generalization of Nemhauser and Trotter's local optimization theorem
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank