Approximating the centroid is hard

MaRDI QIDQ3602887zbMATH OpenFDO

Authors Luis Rademacher

Publication date 12 February 2009

Mathematics Subject Classification ID

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

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; zbMATH DE number 5302815
• On the Complexity of Computing the Volume of a Polyhedron

Cited in

(17)

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

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)