On Combinatorial Depth Measures
From MaRDI portal
Publication:4631012
Recommendations
- On approximating the depth and related problems
- On Approximating the Depth and Related Problems
- On the depth of combinatorial optimization problems
- Computing depth orders and related problems
- A note on the depth function of combinatorial optimization problems
- On the depth complexity of the counting functions
- Depth inequalities for complexes
- On Carlson's depth conjecture
Cites work
- A Quality Index Based on Data Depth and Multivariate Rank Tests
- Absolute approximation of Tukey depth: theory and experiments
- Algorithm AS 307: Bivariate Location Depth
- Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
- Approximating majority depth
- Descriptive statistics for multivariate distributions
- Estimation of Correlation Coefficients by Ellipsoidal Trimming
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem
- Finding simplices containing the origin in two and three dimensions
- General notions of statistical depth function.
- scientific article; zbMATH DE number 3986407 (Why is no real title available?)
- scientific article; zbMATH DE number 3541764 (Why is no real title available?)
- scientific article; zbMATH DE number 3612276 (Why is no real title available?)
- scientific article; zbMATH DE number 1124643 (Why is no real title available?)
- scientific article; zbMATH DE number 1962801 (Why is no real title available?)
- scientific article; zbMATH DE number 6469174 (Why is no real title available?)
- Improved bounds for planar k-sets and related problems
- Lens data depth and median
- Lower bounds for computing statistical depth.
- Multivariate L-estimation. (With comments)
- On a notion of data depth based on random simplices
- On a transformation and re-transformation technique for constructing an affine equivariant multivariate median
- On an Adaptive Transformation–Retransformation Estimate of Multivariate Location
- On Combinatorial Depth Measures
- Optimal Search in Planar Subdivisions
- Ray-shooting depth: computing statistical data depth of point sets in the plane
- Sublinear time algorithms for metric space problems
- The algebraic degree of geometric optimization problems
- Topologically sweeping an arrangement
- Zonoid trimming for multivariate distributions
Cited in
(15)- Point set stratification and Delaunay depth
- Geometric medians
- Lower bounds for computing statistical depth.
- A variant of the Stanley depth for multisets
- Computing the depth distribution of a set of boxes
- Computing colourful simplicial depth and Median in \(\mathbb{R}_2\)
- Tukey depth histograms
- Combinatorial reductions for the Stanley depth of I and S/I
- Algorithms for colourful simplicial depth and medians in the plane
- Ray-shooting depth: computing statistical data depth of point sets in the plane
- Computing a high depth point in the plane
- On Combinatorial Depth Measures
- Monge-Kantorovich depth, quantiles, ranks and signs
- Enclosing depth and other depth measures
- Combinatorial depth measures for hyperplane arrangements
This page was built for publication: On Combinatorial Depth Measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4631012)
