scientific article; zbMATH DE number 7651209
From MaRDI portal
Publication:5874542
DOI10.4230/LIPIcs.ESA.2020.70MaRDI QIDQ5874542
He Sun, Pan Peng, Bogdan-Adrian Manghiuc
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2006.14449
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral sparsification in the semi-streaming setting
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Graph-theoretic properties in computational complexity
- Maximum algebraic connectivity augmentation is NP-hard
- Pseudorandomness for network algorithms
- Design networks with bounded pairwise distance
- Subgraph sparsification and nearly optimal ultrasparsifiers
- Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs
- Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates
- Single Pass Spectral Sparsification in Dynamic Streams
- Spectral Sparsification of Graphs
- Expander codes
- A Combinatorial, Primal-Dual Approach to Semidefinite Programs
- On expander codes
- Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time
- Approximating Low-Stretch Spanners
- Optimal Approximate Matrix Product in Terms of Stable Rank
- Hardness of Approximation for Vertex-Connectivity Network Design Problems
- Fastest Mixing Markov Chain on a Graph
- An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem
- Twice-Ramanujan Sparsifiers
- An SDP-based algorithm for linear-sized spectral sparsification
- An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
- Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design
- Partitioning into Expanders
- Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems
- QIP = PSPACE
- Minimizing Effective Resistance of a Graph
- Partitioning Well-Clustered Graphs: Spectral Clustering Works!
This page was built for publication:
