The norms of graph spanners
From MaRDI portal
Publication:5091190
Recommendations
Cites work
- A local search approximation algorithm for \(k\)-means clustering
- All-norms and all-L_p-norms approximation algorithms
- An Optimal Synchronizer for the Hypercube
- Approximating low-stretch spanners
- Approximation algorithms for label cover and the log-density threshold
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Directed spanners via flow-based linear programs
- Fault-tolerant spanners
- Generating Low-Degree 2-Spanners
- Graph spanners
- scientific article; zbMATH DE number 6696497 (Why is no real title available?)
- scientific article; zbMATH DE number 6472625 (Why is no real title available?)
- scientific article; zbMATH DE number 3258067 (Why is no real title available?)
- Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner
- Least squares quantization in PCM
- Minimizing the union: tight approximations for small set bipartite vertex expansion
- NEW SPARSENESS RESULTS ON GRAPH SPANNERS
- On sparse spanners of weighted graphs
- Sherali-Adams integrality gaps matching the log-density threshold
- The greedy spanner is existentially optimal (extended abstract)
- Transitive-closure spanners
Cited in
(7)- The normal graph conjecture for two classes of sparse graphs
- Graph spanners: a tutorial review
- Lasserre integrality gaps for graph spanners and related problems
- Two remarks on graph norms
- scientific article; zbMATH DE number 2014449 (Why is no real title available?)
- Approximating the norms of graph spanners
- Degrees and network design: new problems and approximations
This page was built for publication: The norms of graph spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091190)
