Pages that link to "Item:Q2941512"
From MaRDI portal
The following pages link to Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates (Q2941512):
Displaying 12 items.
- Near-optimal discrete optimization for experimental design: a regret minimization approach (Q2227544) (← links)
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908) (← links)
- Approximation Algorithms for <i>D</i>-optimal Design (Q3387934) (← 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 Local Search Framework for Experimental Design (Q5092507) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- A General Framework for Graph Sparsification (Q5232324) (← links)
- (Q5874542) (← links)
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions (Q6139829) (← links)
- Optimal experimental design: formulations and computations (Q6598420) (← links)
