An optimal randomized algorithm for d-variate zonoid depth
From MaRDI portal
An optimal randomized algorithm for \(d\)-variate zonoid depth
Recommendations
Cites work
- A combinatorial bound for linear programming and related problems
- Algorithms for bivariate zonoid depth
- Algorithms for ham-sandwich cuts
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- An O(n) algorithm for the multiple-choice knapsack linear program
- Geometric applications of a randomized optimization technique
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3541764 (Why is no real title available?)
- scientific article; zbMATH DE number 1113915 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 1830726 (Why is no real title available?)
- Introduction to algorithms
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- Low-Dimensional Linear Programming with Violations
- Minimizing the sum of the \(k\) largest functions in linear time.
- Multivariate analysis by data depth: Descriptive statistics, graphics and inference. (With discussions and rejoinder)
- Multivariate dispersion, central regions and depth. The lift zonoid approach
- Setting Parameters by Example
- Some results concerning post-infeasibility analysis
Cited in
(5)
This page was built for publication: An optimal randomized algorithm for \(d\)-variate zonoid depth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477199)