3875 search results - page 186 / 775 » Approximation algorithms for the 0-extension problem |
156
Voted
WAOA
2007
Springer
15 years 11 months ago
2007
Springer
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
130
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
152
Voted
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
161
click to vote
COCOON
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of...
159
click to vote
ECCC
2008
15 years 5 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...