4894 search results - page 351 / 979 » The Guarding Problem - Complexity and Approximation |
148
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of Ã...
146
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
153
click to vote
ANOR
2006
15 years 6 months ago
2006
Abstract. We investigate the quality of solutions obtained from sample-average approximations to two-stage stochastic linear programs with recourse. We use a recently developed sof...
196
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
In this paper, we elaborate on the well-known relationship between Gaussian Processes (GP) and Support Vector Machines (SVM) under some convex assumptions for the loss functions. ...
226
click to vote
FOCS
2005
IEEE
16 years 10 days ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...