1647 search results - page 175 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
133
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...
153
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
179
click to vote
ISCAS
2008
IEEE
15 years 11 months ago
2008
IEEE
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
145
click to vote
JCO
2000
15 years 4 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
160
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...