A Tight Lower Bound for Compact Set Packing
Computational Complexity
2023-02-21 v1
Authors:
Huairui Chu
Abstract
This note is devoted to show a simple proof of a tight lower bound of the parameterized compact set packing problem, based on ETH.
Cite
@article{arxiv.2302.09220,
title = {A Tight Lower Bound for Compact Set Packing},
author = {Huairui Chu},
journal= {arXiv preprint arXiv:2302.09220},
year = {2023}
}
Related papers
View all related →
Data Structures and Algorithms · Computer Science
Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling
Karl Bringmann, Anita Dürr, Karol Węgrzycki
2026-03-16
Computational Complexity · Computer Science
Tight Lower Bound for Approximating Parametrized Maximum Likelihood Decoding under ETH
Rishav Gupta, Bingkai Lin, Xin Zheng
2026-05-12
Computational Complexity · Computer Science
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity
Radu Curticapean
2017-05-09
Computational Complexity · Computer Science
On the parameterized complexity of Compact Set Packing
Ameet Gadekar
2023-02-28
Numerical Analysis · Mathematics
A tight lower bound on the minimal dispersion
Matěj Trödler, Jan Volec, Jan Vybíral
2024-03-21
Computational Complexity · Computer Science
Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction
Dániel Marx
2022-03-16
Numerical Analysis · Mathematics
Lower bounds for some decision problems over C
Gregorio Malajovich
2025-10-20
Optimization and Control · Mathematics
On Solving the Set Covering Problem with Conflicts on Sets
Roberto Montemanni, Derek H. Smith
2025-04-22
Data Structures and Algorithms · Computer Science
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
2021-01-20
Combinatorics · Mathematics
A-priori Upper Bounds for the Set Covering Problem
Giovanni Felici, Sokol Ndreca, Aldo Procacci, Benedetto Scoppola
2014-07-18
Machine Learning · Computer Science
Tight Lower Bound on the Probability of a Binomial Exceeding its Expectation
Spencer Greenberg, Mehryar Mohri
2013-11-12
Data Structures and Algorithms · Computer Science
A Tight Lower Bound of $\Omega(\log n)$ for the Estimation of the Number of Defective Items
Nader H. Bshouty, Gergely Harcos
2023-09-19
Computational Complexity · Computer Science
Superlinear Lower Bounds Based on ETH
András Z. Salamon, Michael Wehar
2022-05-18
Data Structures and Algorithms · Computer Science
Betweenness Parameterized Above Tight Lower Bound
Gregory Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo
2013-06-25
Number Theory · Mathematics
Bounds of some parameters of elliptic curve on finite field
Alexey Milovanov
2013-07-03
Data Structures and Algorithms · Computer Science
Minimum-weight partitioning of a set with associated subsets
Yakov Zinder, Bertrand M. T. Lin, Joanna Berlińska
2022-12-13
Computational Complexity · Computer Science
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
Karthik C. S., Dániel Marx, Marcin Pilipczuk, Uéverton Souza
2024-04-18
Computational Geometry · Computer Science
Homology Localization Through the Looking-Glass of Parameterized Complexity Theory
Nello Blaser, Erlend Raa Vågset
2020-12-01
Data Structures and Algorithms · Computer Science
Packing-Based Approximation Algorithm for the k-Set Cover Problem
Martin Furer, Huiwen Yu
2015-03-03
Computational Complexity · Computer Science
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
Ryan Williams
2010-02-03
Data Structures and Algorithms · Computer Science
Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem
Sepehr Assadi, Sanjeev Khanna, Yang Li
2016-03-21
Computational Complexity · Computer Science
Polynomial formulations as a barrier for reduction-based hardness proofs
Tatiana Belova, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin +1
2022-11-30
Data Structures and Algorithms · Computer Science
Parameterized Study of the Test Cover Problem
R. Crowston, G. Gutin, M. Jones, S. Saurabh +1
2012-12-04
Computational Complexity · Computer Science
Bounds and approximation results for scheduling coupled-tasks with compatibility constraints
Rodolphe Giroudeau, Jean-Claude König, Benoit Darties, Gilles Simonin
2017-06-08
Computational Complexity · Computer Science
Vertex Cover Problem Parameterized Above and Below Tight Bounds
Gregory Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou
2009-08-28