1389 search results - page 66 / 278 » Improved Approximation Algorithms for Label Cover Problems |
116
click to vote
KDD
2009
ACM
15 years 9 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
155
click to vote
IPCO
1998
15 years 4 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
128
Voted
GBRPR
2005
Springer
15 years 8 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
146
Voted
ESA
2008
Springer
15 years 4 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
125
click to vote
AUSAI
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. Ant Colony Optimization (ACO) is a collection of metaheuristics inspired by foraging in ant colonies, whose aim is to solve combinatorial optimization problems. We identi...