1647 search results - page 57 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
152
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
143
Voted
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
We present a series of results providing evidence that the incentive problem with VCG-based mechanisms is not very severe. Our first result uses average-case analysis to show that ...
169
Voted
SODA
1992
ACM
15 years 5 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
311
click to vote
AAIM
2011
Springer
14 years 8 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
188
Voted
IFIPTCS
2010
15 years 2 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...