1542 search results - page 30 / 309 » Kernelization of packing problems |
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
Kernel nonnegative matrix factorization (KNMF) is a recent kernel extension of NMF, where matrix factorization is carried out in a reproducing kernel Hilbert space (RKHS) with a f...
MFCS
2005
Springer
14 years 3 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
IANDC
2008
13 years 10 months ago
2008
We consider a natural resource allocation problem in which we are given a set of items, where each item has a list of pairs associated with it. Each pair is a configuration of an a...
CC
2006
Springer
13 years 10 months ago
2006
Springer
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...
TCS
2010
13 years 8 months ago
2010
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...