1647 search results - page 28 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
133
click to vote
STOC
2002
ACM
16 years 2 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
105
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly eff...
131
click to vote
SIAMCOMP
1998
15 years 1 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
106
Voted
ICRA
2002
IEEE
15 years 7 months ago
2002
IEEE
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
108
click to vote
WEA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...