Sciweavers

1647 search results - page 7 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
69
Voted
WADS
2005
Springer
88views Algorithms» more  WADS 2005»
15 years 5 months ago
Approximating the Online Set Multicover Problems via Randomized Winnowing
Piotr Berman, Bhaskar DasGupta
CORR
2008
Springer
96views Education» more  CORR 2008»
14 years 11 months ago
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
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...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
14 years 11 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
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)...
Yossi Azar, Oded Regev
STOC
2002
ACM
84views Algorithms» more  STOC 2002»
15 years 12 months ago
Random sampling and approximation of MAX-CSP problems
Noga Alon, Wenceslas Fernandez de la Vega, Ravi Ka...
IPL
2011
112views more  IPL 2011»
14 years 6 months ago
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
Hiroki Morizumi