5595 search results - page 377 / 1119 » Approximation Algorithms for Clustering Problems |
162
click to vote
EMO
2009
Springer
16 years 1 months ago
2009
Springer
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
167
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
201
click to vote
IPMI
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we present a manifold clustering method for the classification of fibers obtained from diffusion tensor images (DTI) of the human skeletal muscle. Using a linear ...
180
click to vote
SIGECOM
2010
ACM
15 years 7 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
222
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Thermal management is critical for clusters because of the increasing power consumption of modern processors, compact server architectures and growing server density in data center...