1647 search results - page 21 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
CCR
2006
13 years 8 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
RANDOM
2001
Springer
14 years 1 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
AAIM
2007
Springer
2007
Springer
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
14 years 2 months ago
We study three closely related problems motivated by the prediction of RNA secondary structures with arbitrary pseudoknots: the MAXIMUM BASE PAIR STACKINGS problem proposed by Ieon...