• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Constrained min-cut replication for K-way hypergraph partitioning

      Thumbnail
      View / Download
      443.3 Kb
      Author(s)
      Yazici V.
      Aykanat, Cevdet
      Date
      2014
      Source 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
      Article
      Item Usage Stats
      188
      views
      188
      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 optimization
      Graphs
      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
      Permalink
      http://hdl.handle.net/11693/26412
      Published Version (Please cite this version)
      http://dx.doi.org/10.1287/ijoc.2013.0567
      Collections
      • Department of Computer Engineering 1561
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy