36 research outputs found
Assessing the Computational Complexity of Multi-Layer Subgraph Detection
Multi-layer graphs consist of several graphs (layers) over the same vertex
set. They are motivated by real-world problems where entities (vertices) are
associated via multiple types of relationships (edges in different layers). We
chart the border of computational (in)tractability for the class of subgraph
detection problems on multi-layer graphs, including fundamental problems such
as maximum matching, finding certain clique relaxations (motivated by community
detection), or path problems. Mostly encountering hardness results, sometimes
even for two or three layers, we can also spot some islands of tractability
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
When computing stable matchings, it is usually assumed that the preferences
of the agents in the matching market are fixed. However, in many realistic
scenarios, preferences change over time. Consequently, an initially stable
matching may become unstable. Then, a natural goal is to find a matching which
is stable with respect to the modified preferences and as close as possible to
the initial one. For Stable Marriage/Roommates, this problem was formally
defined as Incremental Stable Marriage/Roommates by Bredereck et al. [AAAI
'20]. As they showed that Incremental Stable Roommates and Incremental Stable
Marriage with Ties are NP-hard, we focus on the parameterized complexity of
these problems. We answer two open questions of Bredereck et al. [AAAI '20]: We
show that Incremental Stable Roommates is W[1]-hard parameterized by the number
of changes in the preferences, yet admits an intricate XP-algorithm, and we
show that Incremental Stable Marriage with Ties is W[1]-hard parameterized by
the number of ties. Furthermore, we analyze the influence of the degree of
"similarity" between the agents' preference lists, identifying several
polynomial-time solvable and fixed-parameter tractable cases, but also proving
that Incremental Stable Roommates and Incremental Stable Marriage with Ties
parameterized by the number of different preference lists are W[1]-hard.Comment: Accepted to MFCS'2
Geometric Spanning Cycles in Bichromatic Point Sets
Given a set of points in the plane each colored either red or blue, we find
non-self-intersecting geometric spanning cycles of the red points and of the
blue points such that each edge of the red spanning cycle is crossed at most
three times by the blue spanning cycle and vice-versa
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours
In this paper, we study problems of connecting classes of points via
noncrossing structures. Given a set of colored terminal points, we want to find
a graph for each color that connects all terminals of its color with the
restriction that no two graphs cross each other. We consider these problems
both on the Euclidean plane and in planar graphs.
On the algorithmic side, we give a Gap-ETH-tight EPTAS for the two-colored
traveling salesman problem as well as for the red-blue-green separation problem
(in which we want to separate terminals of three colors with two noncrossing
polygons of minimum length), both on the Euclidean plane. This improves the
work of Arora and Chang (ICALP 2003) who gave a slower PTAS for the simpler
red-blue separation problem. For the case of unweighted plane graphs, we also
show a PTAS for the two-colored traveling salesman problem. All these results
are based on our new patching procedure that might be of independent interest.
On the negative side, we show that the problem of connecting terminal pairs
with noncrossing paths is NP-hard on the Euclidean plane, and that the problem
of finding two noncrossing spanning trees is NP-hard in plane graphs.Comment: 36 pages, 15 figures (colored
An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles
The Lovasz Local Lemma is a seminal result in probabilistic combinatorics. It
gives a sufficient condition on a probability space and a collection of events
for the existence of an outcome that simultaneously avoids all of those events.
Finding such an outcome by an efficient algorithm has been an active research
topic for decades. Breakthrough work of Moser and Tardos (2009) presented an
efficient algorithm for a general setting primarily characterized by a product
structure on the probability space.
In this work we present an efficient algorithm for a much more general
setting. Our main assumption is that there exist certain functions, called
resampling oracles, that can be invoked to address the undesired occurrence of
the events. We show that, in all scenarios to which the original Lovasz Local
Lemma applies, there exist resampling oracles, although they are not
necessarily efficient. Nevertheless, for essentially all known applications of
the Lovasz Local Lemma and its generalizations, we have designed efficient
resampling oracles. As applications of these techniques, we present new results
for packings of Latin transversals, rainbow matchings and rainbow spanning
trees.Comment: 47 page
Solution discovery via reconfiguration for problems in P
In the recently introduced framework of solution discovery via
reconfiguration [Fellows et al., ECAI 2023], we are given an initial
configuration of tokens on a graph and the question is whether we can
transform this configuration into a feasible solution (for some problem) via a
bounded number of small modification steps. In this work, we study solution
discovery variants of polynomial-time solvable problems, namely Spanning Tree
Discovery, Shortest Path Discovery, Matching Discovery, and Vertex/Edge Cut
Discovery in the unrestricted token addition/removal model, the token jumping
model, and the token sliding model. In the unrestricted token addition/removal
model, we show that all four discovery variants remain in P. For the toking
jumping model we also prove containment in P, except for Vertex/Edge Cut
Discovery, for which we prove NP-completeness. Finally, in the token sliding
model, almost all considered problems become NP-complete, the exception being
Spanning Tree Discovery, which remains polynomial-time solvable. We then study
the parameterized complexity of the NP-complete problems and provide a full
classification of tractability with respect to the parameters solution size
(number of tokens) and transformation budget (number of steps) . Along
the way, we observe strong connections between the solution discovery variants
of our base problems and their (weighted) rainbow variants as well as their
red-blue variants with cardinality constraints
Pseudo-random graphs
Random graphs have proven to be one of the most important and fruitful
concepts in modern Combinatorics and Theoretical Computer Science. Besides
being a fascinating study subject for their own sake, they serve as essential
instruments in proving an enormous number of combinatorial statements, making
their role quite hard to overestimate. Their tremendous success serves as a
natural motivation for the following very general and deep informal questions:
what are the essential properties of random graphs? How can one tell when a
given graph behaves like a random graph? How to create deterministically graphs
that look random-like? This leads us to a concept of pseudo-random graphs and
the aim of this survey is to provide a systematic treatment of this concept.Comment: 50 page
Recommended from our members
Algorithmic Graph Theory
The main focus of this workshop was on mathematical techniques needed for the development of efficient solutions and algorithms for computationally difficult graph problems. The techniques studied at the workshhop included: the probabilistic method and randomized algorithms, approximation and optimization, structured families of graphs and approximation algorithms for large problems. The workshop Algorithmic Graph Theory was attended by 46 participants, many of them being young researchers. In 15 survey talks an overview of recent developments in Algorithmic Graph Theory was given. These talks were supplemented by 10 shorter talks and by two special sessions