Centerpoints: A Link Between Optimization and Convex Geometry
From MaRDI portal
Publication:3186488
DOI10.1007/978-3-319-33461-5_2zbMath1419.90073arXiv1511.08609OpenAlexW2265653352MaRDI QIDQ3186488
Publication date: 10 August 2016
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.08609
Related Items (4)
Tight bounds on discrete quantitative Helly numbers ⋮ Centerpoints: A Link between Optimization and Convex Geometry ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Tverberg theorems over discrete sets of points
Cites Work
- Partitions of mass-distributions and of convex bodies by hyperplanes
- Geometric algorithms and combinatorial optimization
- Sharper bounds for Gaussian and empirical processes
- Introductory lectures on convex optimization. A basic course.
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
- On Maximal $S$-Free Sets and the Helly Number for the Family of $S$-Convex Sets
- Transversal numbers over subsets of linear spaces
- Integer Programming with a Fixed Number of Variables
- COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
- INTERMEDIATE SUMS ON POLYHEDRA: COMPUTATION AND REAL EHRHART THEORY
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Solving convex programs by random walks
- The depth function of a population distribution.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Centerpoints: A Link Between Optimization and Convex Geometry
