740 search results - page 36 / 148 » An approximation ratio for biclustering |
132
click to vote
TSP
2008
15 years 1 months ago
2008
In this paper, we consider a coded transmission over a frequency selective channel. We propose to study analytically the convergence of the turbo-detector using a maximum a poster...
103
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
105
click to vote
SIAMCOMP
2010
14 years 8 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
124
click to vote
ICALP
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
SODA
2001
ACM
15 years 3 months ago
2001
ACM
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of ...