No article text was recorded for this version.
k-spanner approximation hardness
Version 1 of 110 papers19 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Improved Approximation for the Directed Spanner Problem
- Blog: Transitive-closure spanners
- Blog: Combinatorial Auctions with Structured Item Graphs
- Blog: Transitive-Closure Spanners
- Blog: Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner
- Blog: Label Cover instances with large girth and the hardness of approximating basic k-spanner
- Blog: Non-Binary Constraints and Optimal Dual-Graph Representations
- Blog: Graph spanners: A tutorial review
- Blog: Manifold-preserving graph reduction for sparse semi-supervised learning
- Blog: An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_k_spanner_approximation_hardness_de5754f9,
title = {k-spanner approximation hardness},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/k-spanner-approximation-hardness/rdr_de5754f9ae4745a8ad84bed688fea74e},
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_k_spanner_approximation_hardness_de5754f9_v1,
title = {k-spanner approximation hardness},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/k-spanner-approximation-hardness/rdr_de5754f9ae4745a8ad84bed688fea74e/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}