Constrained min-cut replication for K-way hypergraph partitioning
Date
2014Source Title
INFORMS Journal on Computing: charting new directions in OR and CS
Print ISSN
1091-9856
Electronic ISSN
1526-5528
Publisher
Institute for Operations Research and the Management Sciences (I N F O R M S)
Volume
26
Issue
2
Pages
303 - 320
Language
English
Type
ArticleItem Usage Stats
188
views
views
188
downloads
downloads
Abstract
Replication is a widely-used technique in information retrieval and database systems for providing fault tolerance and reducing parallelization and processing costs. Combinatorial models based on hypergraph partitioning are proposed for various problems arising in information retrieval and database systems. We consider the possibility of using vertex replication to improve the quality of hypergraph partitioning. In this study, we focus on the constrained min-cut replication (CMCR) problem, where we are initially given a maximum replication capacity and a K-way hypergraph partition with an initial imbalance ratio. The objective in the CMCR problem is finding the optimal vertex replication sets for each part of the given partition such that the initial cut size of the partition is minimized, where the initial imbalance is either preserved or reduced under the given replication capacity constraint. In this study, we present a complexity analysis of the CMCR problem and propose a model based on a unique blend of coarsening and integer linear programming (ILP) schemes. This coarsening algorithm is derived from a novel utilization of the Dulmage-Mendelsohn decomposition. Experiments show that the ILP formulation coupled with the Dulmage-Mendelsohn decomposition-based coarsening provides high quality results in practical execution times for reducing the cut size of a given K-way hypergraph partition. © 2014 INFORMS.
Keywords
Combinatorial optimizationGraphs
Optimization
Programming: integer
Coarsening
Combinatorial optimization
Database systems
Information retrieval
Capacity constraints
Combinatorial models
Dulmage-mendelsohn decompositions
Graphs
Heuristics
Hypergraph partition
Integer linear programming
Integer programming