3894 search results - page 90 / 779 » Approximation Algorithms for Biclustering Problems |
144
click to vote
JDA
2006
15 years 6 months ago
2006
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
156
click to vote
NIPS
2004
15 years 7 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
191
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are widely used because...
155
click to vote
CCCG
2008
15 years 7 months ago
2008
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...
202
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...