3875 search results - page 176 / 775 » Approximation algorithms for the 0-extension problem |
136
click to vote
DIS
2007
Springer
15 years 11 months ago
2007
Springer
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
166
click to vote
SODA
1997
ACM
15 years 6 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
142
Voted
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
128
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
121
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...