Bichromatic separability with two boxes: A general approach

DOI10.1016/j.jalgor.2009.01.001zbMath1192.68174OpenAlexW2066088492MaRDI QIDQ3497513

No author found.

Publication date: 24 July 2009

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2009.01.001

zbMATH Keywords

bioinformaticsdiscrete optimizationclassification problemsalgorithm designdynamic maintenancemaximum consecutive subsequence

Mathematics Subject Classification ID

Database theory (68P15) Data structures (68P05)

Related Items (12)

Separability of imprecise points ⋮ The maximum box problem for moving points in the plane ⋮ Minimizing the error of linear separators on linearly inseparable data ⋮ Variations of largest rectangle recognition amidst a bichromatic point set ⋮ Separating bichromatic point sets in the plane by restricted orientation convex hulls ⋮ Hierarchical design of fast minimum disagreement algorithms ⋮ Polynomial Time Algorithms for Bichromatic Problems ⋮ Maximum-weight planar boxes in \(O(n^2)\) time (and better) ⋮ Computing the coarseness with strips or boxes ⋮ Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points ⋮ Maximum box problem on stochastic points ⋮ Hierarchical Design of Fast Minimum Disagreement Algorithms

This page was built for publication: Bichromatic separability with two boxes: A general approach