On treewidth approximations
From MaRDI portal
Publication:2816043
zbMATH Open1412.05055MaRDI QIDQ2816043FDOQ2816043
Authors: Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca 
Publication date: 1 July 2016
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065305800915?np=y
Recommendations
- Approximation algorithms for treewidth
- On treewidth approximations.
- On Exact Algorithms for Treewidth
- Treewidth and the Computational Complexity of MAP Approximations
- On exact algorithms for treewidth
- scientific article; zbMATH DE number 1361465
- Treewidth: Characterizations, Applications, and Computations
- The algorithmic theory of treewidth
- On Tamaki's Algorithm to Compute Treewidths.
- Inapproximability of treewidth and related problems
Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (27)
- On approximating tree spanners that are breadth first search trees
- Estimating the Size of Branch-and-Bound Trees
- Approximating the treewidth of AT-free graphs.
- Special issue: Treewidth
- A \(c^k n\) 5-approximation algorithm for treewidth
- Graphs with at most two moplexes
- Approximate Turing Kernelization for Problems Parameterized by Treewidth
- On the maximum cardinality search lower bound for treewidth
- On the approximability of two tree drawing conventions
- Title not available (Why is that?)
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
- On the complexity of computing treelength
- Treewidth: Structure and Algorithms
- Approximate Tree Matching in the Presence of Variable Length Don′t Cares
- Title not available (Why is that?)
- Treewidth and the Computational Complexity of MAP Approximations
- Fast Counting with Bounded Treewidth
- Title not available (Why is that?)
- On exact algorithms for treewidth
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- On treewidth approximations.
- Boxicity and treewidth
- Practical approximation algorithms for zero- and bounded-skew trees
- Title not available (Why is that?)
- Inapproximability of treewidth, one-shot pebbling, and related layout problems
- Tree-decompositions with bags of small diameter
This page was built for publication: On treewidth approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816043)
