2698 search results - page 34 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
SUM
2009
Springer
14 years 5 days ago
2009
Springer
We propose a framework to compute the utility of an agreement w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formula...
GBRPR
2005
Springer
14 years 1 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...
STACS
2010
Springer
13 years 5 months ago
2010
Springer
ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...
SIAMJO
2008
13 years 7 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
KDD
2009
ACM
14 years 2 months ago
2009
ACM
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...