5595 search results - page 326 / 1119 » Approximation Algorithms for Clustering Problems |
164
click to vote
IPCO
1998
15 years 8 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
201
click to vote
ANOR
2007
15 years 6 months ago
2007
The quality of multi-stage stochastic optimization models as they appear in asset liability management, energy planning, transportation, supply chain management, and other applicat...
162
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
169
click to vote
BIBE
2007
IEEE
15 years 8 months ago
2007
IEEE
—In this paper, we have modified a constrained clustering algorithm to perform exploratory analysis on gene expression data using prior knowledge presented in the form of constr...
179
Voted
JCB
2008
15 years 6 months ago
2008
The spatial clustering of genes across different genomes has been used to study important problems in comparative genomics, from identification of operons to detection of homologo...