1469 search results - page 126 / 294 » Approximate polynomial decomposition |
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
FSS
2011
14 years 1 months ago
2011
In many practical applications, it is useful to represent a function f(x) by its fuzzy transform, i.e., by the “average” values Fi = f(x) · Ai(x) dx Ai(x) dx over different ...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...