CORR
2002
Springer
13 years 11 months ago
2002
Springer
Abstract. We address the problem of detecting race conditions in programs that use semaphores for synchronization. Netzer and Miller showed that it is NP-complete to detect race co...
CORR
2002
Springer
13 years 11 months ago
2002
Springer
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
CORR
2002
Springer
13 years 11 months ago
2002
Springer
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
CORR
2002
Springer
13 years 11 months ago
2002
Springer
Inthisarticle,wewillformalizethemethodofdualfittingandtheideaoffactor-revealingLP. This combination is used to design and analyze two greedy algorithms for the metric uncapacitated...
CORR
2002
Springer
13 years 11 months ago
2002
Springer
an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...
CORR
2002
Springer
13 years 11 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
CORR
2002
Springer
13 years 11 months ago
2002
Springer
In this paper we study approximation algorithms for solving a general covering integer program. An
CORR
2002
Springer
13 years 11 months ago
2002
Springer
CORR
2002
Springer
13 years 11 months ago
2002
Springer
CORR
2002
Springer
13 years 11 months ago
2002
Springer