586 research outputs found
Planar Disjoint Paths, Treewidth, and Kernels
In the Planar Disjoint Paths problem, one is given an undirected planar graph
with a set of vertex pairs and the task is to find pairwise
vertex-disjoint paths such that the -th path connects to . We
study the problem through the lens of kernelization, aiming at efficiently
reducing the input size in terms of a parameter. We show that Planar Disjoint
Paths does not admit a polynomial kernel when parameterized by unless coNP
NP/poly, resolving an open problem by [Bodlaender, Thomass{\'e},
Yeo, ESA'09]. Moreover, we rule out the existence of a polynomial Turing kernel
unless the WK-hierarchy collapses. Our reduction carries over to the setting of
edge-disjoint paths, where the kernelization status remained open even in
general graphs.
On the positive side, we present a polynomial kernel for Planar Disjoint
Paths parameterized by , where denotes the treewidth of the input
graph. As a consequence of both our results, we rule out the possibility of a
polynomial-time (Turing) treewidth reduction to under the same
assumptions. To the best of our knowledge, this is the first hardness result of
this kind. Finally, combining our kernel with the known techniques [Adler,
Kolliopoulos, Krause, Lokshtanov, Saurabh, Thilikos, JCTB'17; Schrijver,
SICOMP'94] yields an alternative (and arguably simpler) proof that Planar
Disjoint Paths can be solved in time , matching the
result of [Lokshtanov, Misra, Pilipczuk, Saurabh, Zehavi, STOC'20].Comment: To appear at FOCS'23, 82 pages, 30 figure
Graph Minors and Parameterized Algorithm Design
Abstract. The Graph Minors Theory, developed by Robertson and Sey-mour, has been one of the most influential mathematical theories in pa-rameterized algorithm design. We present some of the basic algorithmic techniques and methods that emerged from this theory. We discuss its direct meta-algorithmic consequences, we present the algorithmic appli-cations of core theorems such as the grid-exclusion theorem, and we give a brief description of the irrelevant vertex technique
Fixed-Parameter Tractability of Maximum Colored Path and Beyond
We introduce a general method for obtaining fixed-parameter algorithms for
problems about finding paths in undirected graphs, where the length of the path
could be unbounded in the parameter. The first application of our method is as
follows.
We give a randomized algorithm, that given a colored -vertex undirected
graph, vertices and , and an integer , finds an -path
containing at least different colors in time . This is the
first FPT algorithm for this problem, and it generalizes the algorithm of
Bj\"orklund, Husfeldt, and Taslaman [SODA 2012] on finding a path through
specified vertices. It also implies the first time algorithm for
finding an -path of length at least .
Our method yields FPT algorithms for even more general problems. For example,
we consider the problem where the input consists of an -vertex undirected
graph , a matroid whose elements correspond to the vertices of and
which is represented over a finite field of order , a positive integer
weight function on the vertices of , two sets of vertices , and integers , and the task is to find vertex-disjoint paths
from to so that the union of the vertices of these paths contains an
independent set of of cardinality and weight , while minimizing the
sum of the lengths of the paths. We give a
time randomized algorithm for this problem.Comment: 50 pages, 16 figure
Improving Model Finding for Integrated Quantitative-qualitative Spatial Reasoning With First-order Logic Ontologies
Many spatial standards are developed to harmonize the semantics and specifications of GIS data and for sophisticated reasoning. All these standards include some types of simple and complex geometric features, and some of them incorporate simple mereotopological relations. But the relations as used in these standards, only allow the extraction of qualitative information from geometric data and lack formal semantics that link geometric representations with mereotopological or other qualitative relations. This impedes integrated reasoning over qualitative data obtained from geometric sources and “native” topological information – for example as provided from textual sources where precise locations or spatial extents are unknown or unknowable. To address this issue, the first contribution in this dissertation is a first-order logical ontology that treats geometric features (e.g. polylines, polygons) and relations between them as specializations of more general types of features (e.g. any kind of 2D or 1D features) and mereotopological relations between them. Key to this endeavor is the use of a multidimensional theory of space wherein, unlike traditional logical theories of mereotopology (like RCC), spatial entities of different dimensions can co-exist and be related. However terminating or tractable reasoning with such an expressive ontology and potentially large amounts of data is a challenging AI problem. Model finding tools used to verify FOL ontologies with data usually employ a SAT solver to determine the satisfiability of the propositional instantiations (SAT problems) of the ontology. These solvers often experience scalability issues with increasing number of objects and size and complexity of the ontology, limiting its use to ontologies with small signatures and building small models with less than 20 objects. To investigate how an ontology influences the size of its SAT translation and consequently the model finder’s performance, we develop a formalization of FOL ontologies with data. We theoretically identify parameters of an ontology that significantly contribute to the dramatic growth in size of the SAT problem. The search space of the SAT problem is exponential in the signature of the ontology (the number of predicates in the axiomatization and any additional predicates from skolemization) and the number of distinct objects in the model. Axiomatizations that contain many definitions lead to large number of SAT propositional clauses. This is from the conversion of biconditionals to clausal form. We therefore postulate that optional definitions are ideal sentences that can be eliminated from an ontology to boost model finder’s performance. We then formalize optional definition elimination (ODE) as an FOL ontology preprocessing step and test the simplification on a set of spatial benchmark problems to generate smaller SAT problems (with fewer clauses and variables) without changing the satisfiability and semantic meaning of the problem. We experimentally demonstrate that the reduction in SAT problem size also leads to improved model finding with state-of-the-art model finders, with speedups of 10-99%. Altogether, this dissertation improves spatial reasoning capabilities using FOL ontologies – in terms of a formal framework for integrated qualitative-geometric reasoning, and specific ontology preprocessing steps that can be built into automated reasoners to achieve better speedups in model finding times, and scalability with moderately-sized datasets
Proof Theory of Graph Minors and Tree Embeddings
This thesis explores metamathematical properties of theorems appearing in the Graph Minors series. A number of these theorems have been known to have very high proof-theoretic strength, but an upper bound on many of them, including the graph minor theorem, had never been proved.
We give such upper bounds, by showing that any proofs in the Graph Minors series can be carried out within a system of Pi^1_1-comprehension augmented with induction and bar-induction principles for certain classes of formulas. This establishes a narrow corridor for the possible proof-theoretic strength of many strong combinatorial principles, including the graph minor theorem, immersion theorem, theorems about patchwork containment, and various restrictions, extensions and labelled versions of these theorems. We also determine the precise proof-theoretic strength of some restrictions of the graph minor theorem, and show that they are equivalent to other restricted versions that had been considered before. Finally, we present a combinatorial theorem employing ordinal labelled trees ordered by embedding with gap-condition that may additionally have well-quasi-ordered labels on the vertices, which turns out not to be provable in the theory Pi^1_1-CA. This result suggests a potential for raising the lower bounds of the immersion theorem, and the thesis concludes by outlining this possibility and other avenues for further research
- …