Weighted Depth

Given a set of nn weighted axis-parallel boxes in dd-dimensional space Rd\mathbb{R}^d, find a point pRdp \in \mathbb{R}^d that maximizes the sum of the weights of the boxes containing pp.

Parameters

  • nn: number of boxes
  • dd: dimensionality of space

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 1 of 1 reductions

Other relevant algorithms

Insuffient Data to display table