1647 search results - page 62 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
124
click to vote
SODA
1997
ACM
15 years 6 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...
145
click to vote
COCO
2004
Springer
15 years 8 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
184
Voted
ESA
2003
Springer
15 years 9 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
185
click to vote
ECCC
2011
14 years 8 months ago
2011
The existence of optimal algorithms is not known for any decision problem in NP \ P. We consider the problem of testing the membership in the image of an injective function. We co...
149
Voted
FOCM
2007
15 years 4 months ago
2007
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...