Index Terms
(auto-classified)Note from the TRETS EiC about the new Journal-first track in FPT’21
Recommendations
On some FPT problems without polynomial Turing compressions
AbstractAn impressive hardness theory which can prove compression lower bounds for a large number of FPT problems has been established under the assumption that NP ⊈ coNP/poly. However, there are no problems in FPT for which the existence of ...
Multicut Is FPT
Let $G=(V,E)$ be a graph on $n$ vertices and $R$ be a set of pairs of vertices in $V$ called requests. A multicut is a subset $F$ of $E$ such that every request $xy$ of $R$ is separated by $F$, i.e., every $xy$-path of $G$ intersects $F$. We show that there ...
Linear FPT reductions and computational lower bounds
STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computingWe develop new techniques for deriving very strong computational lower bounds for a class of well-known NP-hard problems, including weighted satisfiability, dominating set, hitting set, set cover, clique, and independent set. For example, although a ...






Comments