A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints
[article]

2015
*
arXiv
*
pre-print

In parameterized complexity, it is a natural idea to consider different generalizations of classic problems. Usually, such generalization are obtained by introducing a "relaxation" variable, where the original problem corresponds to setting this variable to a constant value. For instance, the problem of packing sets of size at most p into a given universe generalizes the Maximum Matching problem, which is recovered by taking p=2. Most often, the complexity of the problem increases with the

arXiv:1411.6756v5
fatcat:pt54utshmfayvnj2ebrgbvzqdi