Pages that link to "Item:Q4978013"
From MaRDI portal
The following pages link to An SDP-based algorithm for linear-sized spectral sparsification (Q4978013):
Displaying 14 items.
- Faster spectral sparsification and numerical algorithms for SDD matrices (Q89555) (← links)
- Spectral sparsification in the semi-streaming setting (Q372976) (← links)
- Faster cut sparsification of weighted graphs (Q2696277) (← links)
- Improved spectral sparsification and numerical algorithms for SDD matrices (Q2904768) (← links)
- Spectral Sparsification of Graphs (Q3096091) (← links)
- Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
- Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time (Q4562276) (← links)
- Finding Sparse Solutions for Packing and Covering Semidefinite Programs (Q5071107) (← links)
- Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs (Q5075785) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- (Q5110511) (← links)
- (Q5874542) (← links)
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)
- Randomized least-squares with minimal oversampling and interpolation in general spaces (Q6573780) (← links)