Pages that link to "Item:Q2941583"
From MaRDI portal
The following pages link to Randomized Rounding for the Largest Simplex Problem (Q2941583):
Displaying 18 items.
- The worst-case running time of the random simplex algorithm is exponential in the height (Q671935) (← links)
- Near-optimal discrete optimization for experimental design: a regret minimization approach (Q2227544) (← links)
- A randomized polynomial-time simplex algorithm for linear programming (Q2931369) (← links)
- Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration (Q3387758) (← links)
- Approximation Algorithms for <i>D</i>-optimal Design (Q3387934) (← links)
- An Improved Private Mechanism for Small Databases (Q3448856) (← links)
- On the optimality of the random hyperplane rounding technique for MAX CUT (Q4537629) (← links)
- Gaussian Process Landmarking on Manifolds (Q5025781) (← links)
- Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes (Q5076319) (← links)
- Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design (Q5085119) (← links)
- An Improved Analysis of Local Search for Max-Sum Diversification (Q5108253) (← links)
- A new contraction technique with applications to congruency-constrained cuts (Q5918921) (← links)
- (Q6084421) (← links)
- Tridiagonal maximum-entropy sampling and tridiagonal masks (Q6162032) (← links)
- An outer-approximation algorithm for maximum-entropy sampling (Q6202951) (← links)
- On the gap between hereditary discrepancy and the determinant lower bound (Q6490279) (← links)
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023 (Q6544493) (← links)
- On the parameterized intractability of determinant maximization (Q6547207) (← links)
