The maximum box problem for moving points in the plane

DOI10.1007/s10878-010-9301-2zbMath1236.90096OpenAlexW2118852326MaRDI QIDQ411213

José-Miguel Díaz-Báñez, Sergey Bereg, Pablo Pérez-Lantero, Inmaculada 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

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

Related Items

Supervised classification and mathematical optimization, Supervised box clustering, Planar maximum-box problem revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Fractional cascading. I: A data structuring technique
• Planar maximum box problem
• Bichromatic separability with two boxes: A general approach
• On Approximating the Depth and Related Problems