Sparse structures are frequently sought when pursuing tractability in optimization problems. They are exploited from both theoretical and computational perspectives to handle complex problems that become manageable when sparsity is present. An example of this type of structure is given by treewidth: a graph theoretical parameter that measures how "tree-like" a graph is. This parameter has been used for decades for analyzing the complexity of various optimization problems and for obtaining tractable algorithms for problems where this parameter is bounded. The goal of this work is to contribute to the understanding of the limits of the treewidth-based tractability in optimization. Our results are as follows. First, we prove that, in a certain sense, the already known positive results on extension complexity based on low treewidth are the best possible. Secondly, under mild assumptions, we prove that treewidth is the only graph-theoretical parameter that yields tractability a wide class of optimization problems, a fact well known in Graphical Models in Machine Learning and in Constraint Satisfaction Problems, which here we extend to an approximation setting in Optimization.
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
Department of Computer Science, Royal Holloway, University of London(伦敦大学皇家霍洛威学院计算机科学系);Algorithms and Complexity Group, TU Wien(维也纳工业大学算法与复杂性组);School of Computing, DePaul University(德保罗大学计算机学院);Department of Computer Science, University of Warwick(华威大学计算机科学系)
Moderately beyond clique-width: reduced component max-leaf and related parameters
Univ Lyon, CNRS, ENS de Lyon, Université Claude Bernard Lyon 1(里昂大学、法国国家科学研究中心、巴黎高等师范学院里昂分校、克洛德·贝尔纳里昂大学);Institute of Informatics, University of Warsaw(华沙大学信息学研究所);Department of Mathematics and Research Institute for Natural Sciences, Hanyang University(汉阳大学数学系与自然科学研究所);Discrete Mathematics Group, Institute for Basic Science (IBS)(基础科学研究院离散数学组)