scientific article; zbMATH DE number 7651209
From MaRDI portal
Publication:5874542
DOI10.4230/LIPICS.ESA.2020.70MaRDI QIDQ5874542FDOQ5874542
Authors: Bogdan-Adrian Manghiuc, Pan Peng, He Sun 
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2006.14449
Title of this publication is not available (Why is that?)
Cites Work
- Twice-Ramanujan sparsifiers
- Title not available (Why is that?)
- Subgraph sparsification and nearly optimal ultrasparsifiers
- Spectral sparsification of graphs
- Expander codes
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Pseudorandomness for network algorithms
- QIP = PSPACE
- Single pass spectral sparsification in dynamic streams
- Spectral sparsification in the semi-streaming setting
- Constructing linear-sized spectral sparsification in almost-linear time
- An SDP-based algorithm for linear-sized spectral sparsification
- On expander codes
- Fastest Mixing Markov Chain on a Graph
- Hardness of Approximation for Vertex-Connectivity Network Design Problems
- Minimizing Effective Resistance of a Graph
- Design networks with bounded pairwise distance
- Partitioning into expanders
- An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
- Title not available (Why is that?)
- An \(O(\log^2{k})\)-approximation algorithm for the \(k\)-vertex connected spanning subgraph problem
- Parameters of two-prover-one-round game and the hardness of connectivity problems
- Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs
- Maximum algebraic connectivity augmentation is NP-hard
- Graph-theoretic properties in computational complexity
- Approximating low-stretch spanners
- Optimal Approximate Matrix Product in Terms of Stable Rank
- Partitioning well-clustered graphs: spectral clustering works!
- Proportional volume sampling and approximation algorithms for \(A\)-optimal design
- Towards an SDP-based approach to spectral methods: a nearly-linear-time algorithm for graph partitioning and decomposition
- Spectral sparsification and regret minimization beyond matrix multiplicative updates
- A combinatorial, primal-dual approach to semidefinite programs
Cited In (3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874542)
