Constrained min-cut replication for k-way hypergraph partitioning

Name: Constrained min-cut replication for k-way hypergraph partitioning
Author: Yazıcı, Volkan, Aykanat, C.

İsim	Constrained min-cut replication for k-way hypergraph partitioning
Yazar	Yazıcı, Volkan, Aykanat, C.
Basım Tarihi:	2014
Basım Yeri	- Informs
Konu	Combinatorial optimization, Graphs, Heuristics, Optimization, Programming, Integer
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	1526-5528
Kayıt Numarası	c1a12b34-0a70-4ccd-986e-07966fdaf729
Lokasyon	Computer Science
Tarih	2014
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	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.
DOI	10.1287/ijoc.2013.0567
Cilt	26

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Constrained min-cut replication for k-way hypergraph partitioning

Yazar Yazıcı, Volkan, Aykanat, C.

Basım Tarihi 2014

Basım Yeri - Informs

Konu Combinatorial optimization, Graphs, Heuristics, Optimization, Programming, Integer

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 1526-5528

Kayıt Numarası c1a12b34-0a70-4ccd-986e-07966fdaf729

Lokasyon Computer Science

Tarih 2014

Notlar Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Örnek Metin 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.

DOI 10.1287/ijoc.2013.0567

Cilt 26