1554 search results - page 82 / 311 » Parameterized Complexity and Approximation Algorithms |
138
click to vote
SGP
2003
15 years 6 months ago
2003
We present a new remeshing scheme based on the idea of improving mesh quality by a series of local modifications of the mesh geometry and connectivity. Our contribution to the fa...
160
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
140
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
136
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
139
click to vote
JACM
1998
15 years 4 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...