1389 search results - page 151 / 278 » Improved Approximation Algorithms for Label Cover Problems |
149
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
139
click to vote
ALGORITHMICA
2004
15 years 3 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
123
click to vote
RANDOM
2001
Springer
15 years 7 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...
118
Voted
FOCS
1996
IEEE
15 years 7 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
108
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...