No article text was recorded for this version.
fixed-parameter inapproximability
Version 1 of 123 papers42 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Simple Combinatorial Construction of the ko (1)-Lower Bound for Approximating the Parameterized k-Clique
- Blog: Fixed-Parameter and Approximation Algorithms: A New Look
- Blog: From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More
- Blog: An FPT Algorithm Beating 2-Approximation for k-Cut
- Blog: Tight Running Time Lower Bounds for Strong Inapproximability of Maximum k-Coverage, Unique Set Cover and Related Problems (via t-Wise Agreement Testing Theorem)
- Blog: Parameterized Intractability of Even Set and Shortest Vector Problem
- Blog: ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network
- Blog: Parameterized Complexity Classification for Interval Constraints
- Blog: On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes
- Blog: On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
- Blog: On the Parameterized Complexity of Approximating Dominating Set
- Blog: Faster Exact and Approximate Algorithms for k-Cut
- Blog: Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291)
- Blog: On the robust hardness of Gröbner basis computation
- Blog: Solving Packing Problems with Few Small Items Using Rainbow Matchings
- Blog: Polylogarithmic approximation for minimum planarization (almost)
- Blog: New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041)
- Blog: Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH
- Blog: Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting
- Blog: The Strongish Planted Clique Hypothesis and Its Consequences
- Blog: On the Complexity of Knapsack under Explorable Uncertainty: Hardness and Algorithms
- Blog: Unsplittable Flow on a Short Path
- Blog: Sidestepping Barriers for Dominating Set in Parameterized Complexity
History & citation
Current · Permanent link
- This direction split from Bypassing Approximation Barriers with Fixed Parameter Tractability (70% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_fixed_parameter_inapproximability_4de5f3d9,
title = {fixed-parameter inapproximability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fixed-parameter-inapproximability/rdr_4de5f3d961744cebbece10ddc19b2253},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_fixed_parameter_inapproximability_4de5f3d9_v1,
title = {fixed-parameter inapproximability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/fixed-parameter-inapproximability/rdr_4de5f3d961744cebbece10ddc19b2253/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}