1389 search results - page 73 / 278 » Improved Approximation Algorithms for Label Cover Problems |
123
click to vote
FOCS
2000
IEEE
15 years 6 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
122
click to vote
EMMCVPR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
109
click to vote
IPL
2002
15 years 2 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
126
click to vote
LATIN
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
137
click to vote
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...