1647 search results - page 7 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
WADS
2005
Springer
14 years 1 months ago
2005
Springer
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
ALGORITHMICA
2006
13 years 7 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
IPL
2011
13 years 2 months ago
2011
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...