3894 search results - page 66 / 779 » Approximation Algorithms for Biclustering Problems |
172
click to vote
DISOPT
2006
15 years 6 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
209
click to vote
MLDM
2010
Springer
15 years 28 days ago
2010
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
154
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
164
click to vote
IJKESDP
2010
15 years 4 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
283
click to vote
WADS
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...