Pages that link to "Item:Q4435530"
From MaRDI portal
The following pages link to Deterministic and randomized polynomial‐time approximation of radii (Q4435530):
Displaying 17 items.
- Error bounds for consistent reconstruction: random polytopes and coverage processes (Q285436) (← links)
- Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints (Q481050) (← links)
- Geometric clustering for the consolidation of farmland and woodland (Q483564) (← links)
- On clustering bodies: geometry and polyhedral approximation (Q603849) (← links)
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems (Q644908) (← links)
- On the reverse Loomis-Whitney inequality (Q724946) (← links)
- Constrained clustering via diagrams: a unified theory and its application to electoral district design (Q1695008) (← links)
- Polytopal approximation of elongated convex bodies (Q1707430) (← links)
- Fixed-parameter complexity and approximability of norm maximization (Q2340407) (← links)
- A note on approximation of a ball by polytopes (Q2386205) (← links)
- On the convergence to equilibrium of Kac's random walk on matrices (Q2389608) (← links)
- Smallest singular value of random matrices and geometry of random polytopes (Q2484431) (← links)
- Probability Bounds for Polynomial Functions in Random Variables (Q5244874) (← links)
- Hardness and Approximation Results for <i>L<sub>p</sub></i>-Ball Constrained Homogeneous Polynomial Optimization Problems (Q5247613) (← links)
- Radii minimal projections of polytopes and constrained optimization of symmetric polynomials (Q5488627) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900932) (← links)
- Guarantees for Spontaneous Synchronization on Random Geometric Graphs (Q6196197) (← links)
