287 search results - page 12 / 58 » Constant Factor Approximations for the Hotlink Assignment Pr... |
FOCS
2004
IEEE
14 years 9 days ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
CSR
2007
Springer
14 years 2 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
FOCS
2004
IEEE
14 years 9 days ago
2004
IEEE
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...