Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0705.1956

A Branch and Cut Algorithm for the Halfspace Depth Problem

Dan Chen
View original source ↗Read source document ↗Export metadata ↓

Abstract

The concept of data depth in non-parametric multivariate descriptive statistics is the generalization of the univariate rank method to multivariate data. Halfspace depth is a measure of data depth. Given a set S of points and a point p, the halfspace depth (or rank) k of p is defined as the minimum number of points of S contained in any closed halfspace with p on its boundary. Computing halfspace depth is NP-hard, and it is equivalent to the Maximum Feasible Subsystem problem. In this thesis a mixed integer program is formulated with the big-M method for the halfspace depth problem. We suggest a branch and cut algorithm. In this algorithm, Chinneck's heuristic algorithm is used to find an upper bound and a related technique based on sensitivity analysis is used for branching. Irreducible Infeasible Subsystem (IIS) hitting set cuts are applied. We also suggest a binary search algorithm which may be more stable numerically. The algorithms are implemented with the BCP framework from the COIN-OR project.

Explore related subjects

cs.CG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dan Chen. 2007-05-14. A Branch and Cut Algorithm for the Halfspace Depth Problem. https://arxiv.org/abs/0705.1956

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Approximation algorithm for mixed volumes of a constant number of convex bodies

We study the computation of mixed volumes of convex sets given as rational subspace sections of bodies described by membership oracles. The sets need not have nonempty interior. For positive multiplicities $α_1+\cdots+α_k=n$, we give a randomized algorithm that computes a relative $\varepsilon$-approximation with probability at least $1-δ$. Its running time is polynomial in Gurvits' factor $Γ_α=(n^n/n!)\prod_iα_i!/α_i^{α_i}$, the input presentation length, and $\varepsilon^{-1}$, and linear in $1+\logδ^{-1}$, with degree independent of $k$. The running-time bound holds for every choice of the random bits, and zero mixed volumes are detected exactly. We extend the capacity-scaling and sampling method of Narayanan--Roy by using rational projections and a smooth mixed Monge--Ampère representation. In particular, the algorithm runs in randomized polynomial time when the number of distinct convex sets is bounded above by a constant.

cs.CG↗
arXiv2026

Beyond Homology: Non-Abelian and Orientability Invariants Sensitivity in Cellular Networks

Topological deep learning (TDL) architectures are typically evaluated on synthetic complex pairs that differ in a target invariant. Yet, whether a model recovers that invariant or an artifact of the chosen discretization is seldom audited. To examine this, we design and test pairs of complexes that look identical to standard homological and local message-passing tests, have the same Hasse graphs, yet differ in the target invariant. We study two beyond-homology regimes: nonAbelian fundamental-group structure and homotopy-matched orientability. For the former, we construct genus-2 pairs that match homology, cell statistics, local incidence profiles, and rank-colored Hasse 1-WL behavior while differing in their fundamental groups. For the latter, we evaluate punctured torus-Klein bottle pairs and show that distance, boundary, cycle, and spectral signals can confound apparent orientability detection, motivating stronger matched controls. Under the tested settings, subcomplex-lifted architectures separate some pairs beyond the matched homological, local-incidence, and Hasse 1-WL controls, while a depth sweep reveals an empirical depth-dependent trend without establishing a general barrier or direct computation of the target invariants. These results show that claims of topological expressivity must be stated relative to the model representation, explicitly controlled information channels, and the precise scope of the benchmark.

cs.CG↗
arXiv2026

Pinch-Free Orientations of Polyomino Grid Graphs

We study lattice-based collective construction of a target polyomino on the integer grid, where robots place unit square blocks subject to two physical constraints: the partial structure must remain connected at all times, and no placement may create an unfillable one-cell gap. We present a wavefront sweep algorithm that computes a dependency structure satisfying the local conditions required for safe assembly. Given a list of n cells sorted lexicographically by coordinates, the orientation can be computed in O(n) time using O(n) auxiliary space.

cs.CG↗