1647 search results - page 106 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
185
Voted
MFCS
2005
Springer
15 years 10 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
118
click to vote
SIAMJO
2008
15 years 4 months ago
2008
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
134
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
136
click to vote
CIKM
2004
Springer
15 years 10 months ago
2004
Springer
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
157
click to vote
WADS
2007
Springer
15 years 11 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...