Approximate association via dissociation (Q505447): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Approximate Association via Dissociation
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6667975
@@ Property / title @@
+Approximate Association via Dissociation (English)
@@ Property / title: Approximate Association via Dissociation (English) / rank @@
+Normal rank
@@ Property / zbMATH Open document ID @@
+.05230
@@ Property / zbMATH Open document ID: 1417.05230 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-662-53536-3_2
@@ Property / DOI: 10.1007/978-3-662-53536-3_2 / rank @@
+Normal rank
@@ Property / published in @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / published in: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+December 2016Timestamp +2016-12-22T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2016-12-22T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 22 December 2016 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6667975
@@ Property / zbMATH DE Number: 6667975 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4210308458
@@ Property / OpenAlex ID: W4210308458 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2268693425
@@ Property / OpenAlex ID: W2268693425 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.08276
@@ Property / arXiv ID: 1510.08276 / rank @@
+Normal rank
@@ Property / cites work @@
+Aggregating inconsistent information
@@ Property / cites work: Aggregating inconsistent information / rank @@
+Normal rank
@@ Property / cites work @@
+Correlation clustering
@@ Property / cites work: Correlation clustering / rank @@
+Normal rank
@@ Property / cites work @@
+A fast branching algorithm for cluster vertex deletion
+Normal rank
@@ Property / cites work @@
+Structural parameterizations for boxicity
@@ Property / cites work: Structural parameterizations for boxicity / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+Cluster editing: kernelization based on edge cuts
@@ Property / cites work: Cluster editing: kernelization based on edge cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering with qualitative information
@@ Property / cites work: Clustering with qualitative information / rank @@
+Normal rank
@@ Property / cites work @@
+Constant thresholds can make target set selection tractable
+Normal rank
@@ Property / cites work @@
+Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for hitting 3-vertex paths
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of the algorithmic aspects of modular decomposition
+Normal rank
@@ Property / cites work @@
+Q5503435
@@ Property / cites work: Q5503435 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for cluster vertex deletion
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Edge deletion problems: branching facilitated by modular decomposition
+Normal rank
@@ Property / cites work @@
+Modular decomposition and transitive orientation
@@ Property / cites work: Modular decomposition and transitive orientation / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs indecomposable with respect to the X-join
@@ Property / cites work: Graphs indecomposable with respect to the X-join / 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 @@
+The Comparability Graph of a Tree
@@ Property / cites work: The Comparability Graph of a Tree / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-threshold graphs
@@ Property / cites work: Quasi-threshold graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank