Min-Weight k-Enclosing Rectangle

Given $n$ points in the plane each with a real weight, and given an integer $k$ , compute an axis-aligned rectangle enclosing exactly $k$ points with minimal total weight.

Parameters

$n$ : number of points
$k$ : number of points desired in rectangle

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 1 of 1 reductions

			See more
(min, +) Convolution	Min-Weight k-Enclosing Rectangle	2019

Other relevant algorithms