On largest volume simplices and sub-determinants

DOI10.1137/1.9781611973730.23zbMath1371.68290arXiv1406.3512OpenAlexW2951331794MaRDI QIDQ5362979

Marco Di Summa, Yuri Faenza, Carsten Moldenhauer, Friedrich Eisenbrand

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.3512

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Length, area, volume and convex sets (aspects of convex geometry) (52A38)

Related Items (17)

Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes ⋮ Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design ⋮ A Local Search Framework for Experimental Design ⋮ On proportional volume sampling for experimental design in general spaces ⋮ Advances on strictly \(\varDelta \)-modular IPs ⋮ On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems ⋮ Unnamed Item ⋮ Near-optimal discrete optimization for experimental design: a regret minimization approach ⋮ Rational polyhedral outer-approximations of the second-order cone ⋮ A new contraction technique with applications to congruency-constrained cuts ⋮ Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration ⋮ Approximation Algorithms for D-optimal Design ⋮ On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices ⋮ Hardness results for multimarginal optimal transport problems ⋮ Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices ⋮ An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem ⋮ The integrality number of an integer program

This page was built for publication: On largest volume simplices and sub-determinants