DeepAI

# On the parameterized complexity of Compact Set Packing

The Set Packing problem is, given a collection of sets 𝒮 over a ground set 𝒰, to find a maximum collection of sets that are pairwise disjoint. The problem is among the most fundamental NP-hard optimization problems that have been studied extensively in various computational regimes. The focus of this work is on parameterized complexity, Parameterized Set Packing (PSP): Given r ∈ℕ, is there a collection 𝒮' ⊆𝒮: |𝒮'| = r such that the sets in 𝒮' are pairwise disjoint? Unfortunately, the problem is not fixed parameter tractable unless 𝖶[1] = 𝖥𝖯𝖳, and, in fact, an "enumeration" running time of |𝒮|^Ω(r) is required unless the exponential time hypothesis (ETH) fails. This paper is a quest for tractable instances of Set Packing from parameterized complexity perspectives. We say that the input (𝒰,𝒮) is "compact" if |𝒰| = f(r)·Θ(( log |𝒮|)), for some f(r) ≥ r. In the Compact Set Packing problem, we are given a compact instance of PSP. In this direction, we present a "dichotomy" result of PSP: When |𝒰| = f(r)· o(log |𝒮|), PSP is in , while for |𝒰| = r·Θ(log (|𝒮|)), the problem is W[1]-hard; moreover, assuming ETH, Compact PSP does not even admit |𝒮|^o(r/log r) time algorithm.

08/08/2020

### Parameterized Complexity of (A,ℓ)-Path Packing

Given a graph G = (V,E), A ⊆ V, and integers k and ℓ, the (A,ℓ)-Path Pac...
11/17/2022

### (Re)packing Equal Disks into Rectangle

The problem of packing of equal disks (or circles) into a rectangle is a...
02/20/2018

### The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments

Given a directed graph D on n vertices and a positive integer k, the Arc...
01/12/2021

### Diverse Collections in Matroids and Graphs

We investigate the parameterized complexity of finding diverse sets of s...
06/24/2018

### On r-Simple k-Path and Related Problems Parameterized by k/r

Abasi et al. (2014) and Gabizon et al. (2015) studied the following prob...
09/26/2019

### How does object fatness impact the complexity of packing in d dimensions?

Packing is a classical problem where one is given a set of subsets of Eu...
01/19/2021

### Anticoncentration versus the number of subset sums

Let w⃗ = (w_1,…, w_n) ∈ℝ^n. We show that for any n^-2≤ϵ≤ 1, if #{ξ⃗...