arXiv (All)
open access
Exposition of an approximation algorithm for mixed volumes of a constant number of convex bodies
We study $\varepsilon$-relative approximation of mixed volumes of a fixed number $k$ of full-dimensional convex bodies in $\mathbb{R}^n$, given membership oracles and a known bound $B_n\subseteq K_i\subseteq R_0B_n$. We present a randomized algorithm that estimates any prescribed mixed volume within
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Simultaneous random polytope approximation characterizes the Euclidean ball#1342413
- Scalable Minimum-Volume Simplex Estimation with Non-asymptotic Analysis#1061214
- Product approximations for uniform spanning trees and determinantal processes#1248834
- Quasi-uniform designs from random candidates: optimal candidate complexity and farthest-point sampling#973598
- Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors#1227302
Record · ID 1217983
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive