Parameterization and approximation are two popular ways of coping with NP-hard
problems. More recently, the two have also been combined to derive many interesting …

In the Min k-Cut problem, the input consists of an edge weighted graph G and an integer k,
and the task is to partition the vertex set into k nonempty sets, such that the total weight of the …

Over the past decade, many results have focused on the design of parameterized
approximation algorithms for W [1]-hard problems. However, there are fundamental …

We consider the Hypergraph-k-Cut problem. The input consists of a hypergraph G=(V, E)
with nonnegative hyperedge-costs c: E→ R+ and a positive integer k. The objective is to find …

The Parameterized Inapproximability Hypothesis (PIH) asserts that no fixed parameter
tractable (FPT) algorithm can distinguish a satisfiable CSP instance, parameterized by the …

The goal of this paper is to understand how exponential-time approximation algorithms can
be obtained from existing polynomial-time approximation algorithms, existing parameterized …

Abstract In the Min k-Cut problem, the input is a graph G and an integer k. The task is to find
a partition of the vertex set of G into k parts, while minimizing the number of edges that go …

The Parameterized Inapproximability Hypothesis (PIH) asserts that no fixed parameter
tractable (FPT) algorithm can distinguish a satisfiable CSP instance, parameterized by the …

We consider the problem of enumerating optimal solutions for two hypergraph k-partitioning
problems, namely, Hypergraph-k-Cut and Minmax-Hypergraph-k-Partition. The input in …

Given an edge-weighted graph, how many minimum k-cuts can it have? This is a
fundamental question in the intersection of algorithms, extremal combinatorics, and graph …