Approximating the centroid is hard

zbMATH Open1221.68095MaRDI QIDQ3602887FDOQ3602887

Authors: Luis Rademacher 

Publication date: 12 February 2009

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

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)

Cited In (15)

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

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)