Randomized Rounding for the Largest Simplex Problem

DOI10.1145/2746539.2746628zbMath1321.68319arXiv1412.0036OpenAlexW2964269311MaRDI QIDQ2941583

Aleksandar Nikolov

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

convex optimizationdiscrepancy theorycomputational geometryapproximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (14)

An Improved Private Mechanism for Small Databases ⋮ Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes ⋮ Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design ⋮ Advances on strictly \(\varDelta \)-modular IPs ⋮ An Improved Analysis of Local Search for Max-Sum Diversification ⋮ Tridiagonal maximum-entropy sampling and tridiagonal masks ⋮ An outer-approximation algorithm for maximum-entropy sampling ⋮ An outer-approximation algorithm for maximum-entropy sampling ⋮ Unnamed Item ⋮ Near-optimal discrete optimization for experimental design: a regret minimization approach ⋮ A new contraction technique with applications to congruency-constrained cuts ⋮ Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration ⋮ Approximation Algorithms for D-optimal Design ⋮ Gaussian Process Landmarking on Manifolds

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: Randomized Rounding for the Largest Simplex Problem