Index Terms
- Algorithm 63: partition
Recommendations
An Efficient Algorithm for Judicious Partition of Hypergraphs
Combinatorial Optimization and ApplicationsAbstractJudicious partition of hypergraphs =(V, H) is to optimize several quantities simultaneously, and the goal of this paper is to partition the vertex set V into K parts: so as to minimize the , where is the ...
A gradient method on the initial partition of Fiduccia-Mattheyses algorithm
ICCAD '95: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided designIn this paper, a Fiduccia-Mattheyses (FM) algorithm incorporating a novel initial partition generating method is proposed. The proposed algorithm applies to both bipartitioning and multi-way partitioning problems with or without replication. The initial ...
A Fast Approximation Algorithm for the k Partition-Distance Problem
ICCSA '09: Proceedings of the International Conference on Computational Science and Its Applications: Part IIGiven a set of elements <em>N</em> , a partition consists on dividing the set of elements into two or more disjoint clusters that cover all elements. A cluster contains a non-empty subset of elements. The number of clusters of a partition is less than ...
Comments