No article text was recorded for this version.
approximation-hardness gap
Version 1 of 111 papers24 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
- Blog: O(log2 k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm
- Blog: ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network
- Blog: Polynomial Integrality Gap of Flow LP for Directed Steiner Tree
- Blog: Complexity of the Steiner Network Problem with Respect to the Number of Terminals
- Blog: Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds
- Blog: On Approximating Degree-Bounded Network Design Problems
- Blog: Reconstructing a cascade from temporal observations
- Blog: A New Approach for Approximating Directed Rooted Networks
- Blog: From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs
- Blog: The Strongish Planted Clique Hypothesis and Its Consequences
History & citation
Current · Permanent link
- This direction split from The Complexity Gap in Directed Network Design (55% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_approximation_hardness_gap_a133c4c0,
title = {approximation-hardness gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/approximation-hardness-gap/rdr_a133c4c000014431b8b10127ed1c1d8f},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_approximation_hardness_gap_a133c4c0_v1,
title = {approximation-hardness gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/approximation-hardness-gap/rdr_a133c4c000014431b8b10127ed1c1d8f/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}