No article text was recorded for this version.
tightness of complexity bounds
Version 1 of 124 papers33 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Towards (1 + ∊)-Approximate Flow Sparsifiers
- Blog: Exact Flow Sparsification Requires Unbounded Size
- Blog: Towards Tight Bounds for Spectral Sparsification of Hypergraphs
- Blog: Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs
- Blog: Vertex Sparsification in Trees
- Blog: Subgraph Sparsification and Nearly Optimal Ultrasparsifiers
- Blog: How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs
- Blog: Cheeger-Type Approximation for Sparsest st-Cut
- Blog: Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut
- Blog: Cut Sparsification and Succinct Representation of Submodular Hypergraphs
- Blog: Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator
- Blog: Stochastic Matching with Few Queries: (1-ε) Approximation
- Blog: Metric Extension Operators, Vertex Sparsifiers and Lipschitz Extendability
- Blog: Uncertain Graph Sparsification
- Blog: Mimicking Networks and Succinct Representations of Terminal Cuts
- Blog: Vertex Sparsification for Edge Connectivity
- Blog: Lowest-Degree k-Spanner: Approximation and Hardness
- Blog: Friendly Cut Sparsifiers and Faster Gomory-Hu Trees
- Blog: Degree-3 Treewidth Sparsifiers
- Blog: A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning Trees
- Blog: Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs
- Blog: Vertex Sparsifiers: New Results from Old Techniques
- Blog: A Conditional Lower Bound on Graph Connectivity in MapReduce
- Blog: Online Algorithms for Spectral Hypergraph Sparsification
History & citation
Current · Permanent link
- This direction split from Optimal Efficiency in Graph and Hypergraph Sparsification (71% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_tightness_of_complexity_bounds_42618c0a,
title = {tightness of complexity bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/tightness-of-complexity-bounds/rdr_42618c0ac2644e90822aef235eca7a65},
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_tightness_of_complexity_bounds_42618c0a_v1,
title = {tightness of complexity bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/tightness-of-complexity-bounds/rdr_42618c0ac2644e90822aef235eca7a65/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}