An O(n) algorithm for the linear multiple choice knapsack problem and related problems
Information Processing Letters
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
Geometric applications of a randomized optimization technique
Proceedings of the fourteenth annual symposium on Computational geometry
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Introduction to Algorithms
Lectures on Discrete Geometry
SIAM Journal on Computing
Minimizing the sum of the k largest functions in linear time
Information Processing Letters
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Low-Dimensional Linear Programming with Violations
SIAM Journal on Computing
Algorithms for bivariate zonoid depth
Computational Geometry: Theory and Applications
Optimal location of transportation devices
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
A randomized linear expected-time algorithm for computing the zonoid depth [R. Dyckerhoff, G. Koshevoy, K. Mosler, Zonoid data depth: Theory and computation, in: A. Prat (Ed.), COMPSTAT 1996-Proceedings in Computational Statistics, Physica-Verlag, Heidelberg, 1996, pp. 235-240; K. Mosler, Multivariate Dispersion, Central Regions and Depth. The Lift Zonoid Approach, Lecture Notes in Statistics, vol. 165, Springer-Verlag, New York, 2002] of a point with respect to a fixed dimensional point set is presented.