1647 search results - page 61 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
149
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
148
click to vote
COCO
2001
Springer
15 years 10 months ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
185
click to vote
FOCS
2009
IEEE
16 years 27 days ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
156
click to vote
AAAI
2011
14 years 6 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
178
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...