The maximum box problem for moving points in the plane

DOI10.1007/S10878-010-9301-2MaRDI QIDQ411213zbMATH OpenOpenAlexFDO

Authors J. M. Díaz-Báñez, Sergey Bereg, P. Pérez-Lantero, I. Ventura

Publication date 4 April 2012

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.621.2360

zbMATH Keywords

pattern recognitionkinetic data structuremaximum box problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Planar maximum-box problem revisited
• Kinetic red-blue minimum separating circle
• Kinetic 2-centers in the black-box model
• Planar maximum box problem
• Maintaining the extent of a moving point set

Cites work

• scientific article; zbMATH DE number 1501063 (Why is no real title available?)
• Bichromatic separability with two boxes: A general approach
• Fractional cascading. I: A data structuring technique
• On Approximating the Depth and Related Problems
• Pattern classification.
• Planar maximum box problem

Cited in

(6)

• Supervised classification and mathematical optimization
• Maximum box problem on stochastic points
• Planar maximum-box problem revisited
• Kinetic red-blue minimum separating circle
• Maximum-weight planar boxes in \(O(n^2)\) time (and better)
• Supervised box clustering

This page was built for publication: The maximum box problem for moving points in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411213)