1647 search results - page 109 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
181
click to vote
TIP
2002
15 years 4 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
166
Voted
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
155
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
149
click to vote
STACS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...
148
click to vote
SIAMDM
2000
15 years 4 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...