Extension Complexity, MSO Logic, and Treewidth

@inproceedings{Kolman2016ExtensionCM,
  title={Extension Complexity, MSO Logic, and Treewidth},
  author={P. Kolman and M. Kouteck{\'y} and Hans Raj Tiwary},
  booktitle={SWAT},
  year={2016}
}
  • P. Kolman, M. Koutecký, Hans Raj Tiwary
  • Published in SWAT 2016
  • Mathematics, Computer Science
  • We consider the convex hull $P_{\varphi}(G)$ of all satisfying assignments of a given MSO formula $\varphi$ on a given graph $G$. We show that there exists an extended formulation of the polytope $P_{\varphi}(G)$ that can be described by $f(|\varphi|,\tau)\cdot n$ inequalities, where $n$ is the number of vertices in $G$, $\tau$ is the treewidth of $G$ and $f$ is a computable function depending only on $\varphi$ and $\tau.$ In other words, we prove that the extension complexity of $P_{\varphi… CONTINUE READING
    14 Citations

    Figures and Topics from this paper.

    Parameterized Extension Complexity of Independent Set and Related Problems
    • 5
    • PDF
    Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
    • 1
    • Highly Influenced
    • PDF
    Treewidth, Extended Formulations of CSP and MSO Polytopes, and their Algorithmic Applications
    • 1
    LP-branching algorithms based on biased graphs
    • 4
    New limits of treewidth-based tractability in optimization
    • 1
    • Highly Influenced
    • PDF
    Limits of Treewidth-based tractability in Optimization
    On some problems related to 2-level polytopes
    • 3
    • PDF
    Parameterized shifted combinatorial optimization

    References

    SHOWING 1-10 OF 78 REFERENCES
    Parameterized Extension Complexity of Independent Set and Related Problems
    • 5
    • PDF
    Extended formulations, nonnegative factorizations, and randomized communication protocols
    • 37
    • PDF
    The Minimum Vulnerability Problem
    • 17
    • PDF
    Finding Branch-Decompositions and Rank-Decompositions
    • 109
    • PDF
    Practical algorithms for MSO model-checking on tree-decomposable graphs
    • 27
    • PDF
    Easy Problems for Tree-Decomposable Graphs
    • 819
    Treewidth, Extended Formulations of CSP and MSO Polytopes, and their Algorithmic Applications
    • 1
    Strengthening Convex Relaxations of 0/1-Sets Using Boolean Formulas
    • 8
    • PDF
    Monadic datalog over finite structures with bounded treewidth
    • 28
    • Highly Influential
    • PDF
    Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
    • 468
    • PDF