Search Results - "Mnich, Matthias"

Combinatorial n-fold integer programming and applications by Knop, Dušan, Koutecký, Martin, Mnich, Matthias

“…Many fundamental NP -hard problems can be formulated as integer linear programs (ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential…”
Get full text

Approximations for many-visits multiple traveling salesman problems by Bérczi, Kristóf, Mnich, Matthias, Vincze, Roland

“…•First extensive study of the classical multiple TSP with multiple visit requests to cities.•Efficient approximation algorithms with strong worst-case…”
Get full text

Stable Matchings with Covering Constraints: A Complete Computational Trichotomy by Mnich, Matthias, Schlotter, Ildikó

“…Stable matching problems with lower quotas are fundamental in academic hiring and ensuring operability of rural hospitals. Only few tractable (polynomial-time…”
Get full text

High-multiplicity N-fold IP via configuration LP by Knop, Dušan, Koutecký, Martin, Levin, Asaf, Mnich, Matthias, Onn, Shmuel

“…N -fold integer programs (IPs) form an important class of block-structured IPs for which increasingly fast algorithms have recently been developed and…”
Get full text

Max-Cut Parameterized Above the Edwards-Erdős Bound by Crowston, Robert, Jones, Mark, Mnich, Matthias

“…We study the boundary of tractability for the Max-Cut problem in graphs. Our main result shows that Max-Cut parameterized above the Edwards-Erdős bound is…”
Get full text

Reachability Switching Games by John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani

“…We study the problem of deciding the winner of reachability switching games for zero-, one-, and two-player variants. Switching games provide a deterministic…”
Get full text

Scheduling and fixed-parameter tractability by Mnich, Matthias, Wiese, Andreas

“…Fixed-parameter tractability analysis and scheduling are two core domains of combinatorial optimization which led to deep understanding of many important…”
Get full text

Parameterized complexity of machine scheduling: 15 open problems by Mnich, Matthias, van Bevern, René

“…•Recent work on the parameterized complexity of scheduling problems is summarized.•Results before the advent of parameterized complexity are reinterpreted in…”
Get full text

Linear Kernels and Linear-Time Algorithms for Finding Large Cuts by Etscheid, Michael, Mnich, Matthias

“…The maximum cut problem in graphs and its generalizations are fundamental combinatorial problems. Several of these cut problems were recently shown to be…”
Get full text

Serial batching to minimize the weighted number of tardy jobs by Hermelin, Danny, Mnich, Matthias, Omlor, Simon

“…The 1 | s-batch ( ∞ ) , r j | ∑ w j U j scheduling problem takes as input a batch setup time Δ and a set of n jobs, each having a processing time, a release…”
Get full text

New algorithms for maximum disjoint paths based on tree-likeness by Fleszar, Krzysztof, Mnich, Matthias, Spoerhase, Joachim

“…We study the classical  NP -hard problems of finding maximum-size subsets from given sets of  k terminal pairs that can be routed via edge-disjoint paths (…”
Get full text

Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks by Van Iersel, Leo, Kelk, Steven, Mnich, Matthias

“…Phylogenetic networks provide a way to describe and visualize evolutionary histories that have undergone so-called reticulate evolutionary events such as…”
Get more information

Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding by Kulik, Ariel, Mnich, Matthias, Shachnai, Hadas

“…We study the d-DIMENSIONAL VECTOR BIN PACKING (d \mathbf{V B P}) problem, a generalization of BIN PACKING with central applications in resource allocation and…”
Get full text

Kernel and fast algorithm for dense triplet inconsistency by Guillemot, Sylvain, Mnich, Matthias

“…We study the parameterized complexity of inferring supertrees from sets of rooted triplets, an important problem in phylogenetics. For a set L of labels and a…”
Get full text

Feedback Vertex Sets in Tournaments by Gaspers, Serge, Mnich, Matthias

“…We study combinatorial and algorithmic questions around minimal feedback vertex sets (FVS) in tournament graphs. On the combinatorial side, we derive upper and…”
Get full text

Improved integrality gap upper bounds for traveling salesperson problems with distances one and two by Mnich, Matthias, Mömke, Tobias

“…•Integrality gap upper bounds of at most 5/4 for all undirected instances.•Integrality gap upper bounds of at most 3/2 for all directed…”
Get full text

Parameterized algorithms for generalizations of Directed Feedback Vertex Set by Göke, Alexander, Marx, Dániel, Mnich, Matthias

“…The Directed Feedback Vertex Set (DFVS) problem takes as input a directed graph G and seeks a smallest vertex set S that hits all cycles in G. This is one of…”
Get full text

Polynomial kernels for weighted problems by Etscheid, Michael, Kratsch, Stefan, Mnich, Matthias, Röglin, Heiko

“…•We use a technique by Frank and Tardos (Combinatorica 1987) to settle an open problem in kernelization.•We present a polynomial kernelization for Knapsack…”
Get full text

Polynomial kernels for deletion to classes of acyclic digraphs by Mnich, Matthias, van Leeuwen, Erik Jan

“…We consider the problem to find a set X of vertices (or arcs) with |X|≤k in a given digraph G such that D=G−X is an acyclic digraph. In its generality, this is…”
Get full text

Parameterized complexity of configuration integer programs by Knop, Dušan, Koutecký, Martin, Levin, Asaf, Mnich, Matthias, Onn, Shmuel

“…Configuration integer programs (IP) have been key in the design of algorithms for NP-hard high-multiplicity problems. First, we develop fast exact…”
Get full text