Approximating the centroid is hard

MaRDI QIDQ3602887zbMATH OpenFDO

Authors Luis Rademacher

Publication date 12 February 2009

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer-aided design (modeling of curves and surfaces) (65D17) Elementary problems in Euclidean geometries (51M04)

Recommendations

• Complexity of approximating the vertex centroid of a polyhedron
• Complexity of approximating the vertex centroid of a polyhedron
• scientific article; zbMATH DE number 4108152
• scientific article
• On the Complexity of Computing the Volume of a Polyhedron

Cited in

(15)

• Complexity of approximating the vertex centroid of a polyhedron
• Multidimensional binary search for contextual decision-making
• No dice: a deterministic approach to the Cartan centroid
• Penalty-based aggregation of multidimensional data
• The centroid of points with approximate weights
• Complexity of approximating the vertex centroid of a polyhedron
• A copositive framework for analysis of hybrid Ising-classical algorithms
• Fast multidimensional asymptotic and approximate consensus
• Resilient multi-dimensional consensus in adversarial environment
• Non-asymptotic bounds for the \(\ell_{\infty}\) estimator in linear regression with uniform noise
• How to integrate a polynomial over a simplex
• Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations
• Relaxing the strong triadic closure problem for edge strength inference
• Staffing large-scale service systems with distributional uncertainty
• Covering convex bodies and the closest vector problem

This page was built for publication: Approximating the centroid is hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602887)