3875 search results - page 105 / 775 » Approximation Algorithms for the Max-coloring Problem |
FOCS
2004
IEEE
14 years 20 days 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...
COCOON
2006
Springer
14 years 20 days 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...
ECCC
2008
13 years 9 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...
INFORMS
2008
13 years 9 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
EOR
2006
13 years 9 months ago
2006
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...