1647 search results - page 45 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
138
click to vote
WADS
2007
Springer
15 years 8 months ago
2007
Springer
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
114
click to vote
ICPP
1998
IEEE
15 years 6 months ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
111
click to vote
TCS
2010
15 years 21 days ago
2010
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
140
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
115
click to vote
SIAMDM
2002
15 years 2 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...