Show simple item record

dc.contributor.authorYazıcı, Volkan
dc.contributor.authorAykanat, C.
dc.date.accessioned2014-12-21T12:32:49Z
dc.date.available2014-12-21T12:32:49Z
dc.date.issued2014
dc.identifier.issn1526-5528
dc.identifier.urihttp://pubsonline.informs.org/doi/abs/10.1287/ijoc.2013.0567
dc.identifier.urihttp://hdl.handle.net/10679/754
dc.descriptionDue to copyright restrictions, the access to the full text of this article is only available via subscription.
dc.description.abstractReplication 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.en_US
dc.description.sponsorshipTÜBİTAK
dc.language.isoengen_US
dc.publisherInformsen_US
dc.relationinfo:turkey/grantAgreement/TUBITAK/109E019en_US
dc.relation.ispartofINFORMS Journal on Computing
dc.rightsrestrictedAccess
dc.titleConstrained min-cut replication for k-way hypergraph partitioningen_US
dc.typeArticleen_US
dc.peerreviewedyesen_US
dc.publicationstatuspublisheden_US
dc.contributor.departmentÖzyeğin University
dc.contributor.authorID184150
dc.contributor.ozuauthorYazıcı, Volkan
dc.identifier.volume26
dc.identifier.issue2
dc.identifier.startpage303
dc.identifier.endpage320
dc.identifier.wosWOS:000334602800009
dc.identifier.doi10.1287/ijoc.2013.0567
dc.subject.keywordsCombinatorial optimizationen_US
dc.subject.keywordsGraphsen_US
dc.subject.keywordsHeuristicsen_US
dc.subject.keywordsOptimizationen_US
dc.subject.keywordsProgrammingen_US
dc.subject.keywordsIntegeren_US
dc.identifier.scopusSCOPUS:2-s2.0-84899490060
dc.contributor.authorMale1


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record


Share this page