1964 search results - page 26 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
IAT
2008
IEEE
14 years 2 months ago
2008
IEEE
The discrete particle swarm optimization (DPSO) is a kind of particle swarm optimization (PSO) algorithm to find optimal solutions for discrete problems. This paper proposes an i...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Distributing spatially located heterogeneous workloads is an important problem in parallel scientific computing. We investigate the problem of partitioning such workloads (repres...
AIRS
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents a novel algorithm for document clustering based on a combinatorial framework of the Principal Direction Divisive Partitioning (PDDP) algorithm [1] and a simpli...
JCSS
2002
13 years 7 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
NETWORKS
2006
13 years 7 months ago
2006
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...