Login / Signup

On packing and covering polyhedra of consecutive ones circulant clutters.

Néstor E. Aguilera
Published in: Discret. Appl. Math. (2010)
Keyphrases
  • packing problem
  • special case
  • least squares
  • cluttered environments
  • fourier transform
  • data sets
  • convex polyhedra
  • database
  • information retrieval
  • three dimensional
  • similarity measure
  • line drawings
  • extreme points