期刊名称：Journal of Emerging Trends in Computing and Information Sciences
电子版ISSN：2079-8407
出版年度：2012
卷号：3
期号：6
页码：1003-1007
出版社：ARPN Publishers
摘要：Let P be a set of n points on a two-dimensional plane. In this work, we present an algorithm that identi es a smallest area axis-parallel rectangle enclosing at least k points of P (1
关键词：Enclosing Problem; k-Enclosing Problem; Optimization Problem; Decision Problem
