Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536): Difference between revisions

@@ Property / describes a project that uses @@
+symrcm
@@ Property / describes a project that uses: symrcm / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3000704721
@@ Property / OpenAlex ID: W3000704721 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.08141
@@ Property / arXiv ID: 1606.08141 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q126345508
@@ Property / Wikidata QID: Q126345508 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4288579
@@ Property / cites work: Q4288579 / rank @@
+Normal rank
@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems
+Normal rank
@@ Property / cites work @@
+On subexponential and FPT-time inapproximability
@@ Property / cites work: On subexponential and FPT-time inapproximability / rank @@
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+Chordal completions of planar graphs
@@ Property / cites work: Chordal completions of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The PCP theorem by gap amplification
@@ Property / cites work: The PCP theorem by gap amplification / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential Parameterized Algorithm for Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Nested Dissection of a Regular Finite Element Mesh
+Normal rank
@@ Property / cites work @@
+Q3664299
@@ Property / cites work: Q3664299 / rank @@
+Normal rank
@@ Property / cites work @@
+The analysis of a nested dissection algorithm
@@ Property / cites work: The analysis of a nested dissection algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+Generalized Nested Dissection
@@ Property / cites work: Generalized Nested Dissection / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4904144
@@ Property / cites work: Q4904144 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Graph expansion and the unique games conjecture
@@ Property / cites work: Graph expansion and the unique games conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036610
@@ Property / cites work: Q4036610 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5683627
@@ Property / cites work: Q5683627 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4117301
@@ Property / cites work: Q4117301 / rank @@
+Normal rank
@@ Property / cites work @@
+Interval Completion Is Fixed Parameter Tractable
@@ Property / cites work: Interval Completion Is Fixed Parameter Tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of Treewidth and Related Problems
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank