Multilevel Memetic Hypergraph Partitioning with Greedy Recombination
Utku Umur Acikalin, Bugra Caskurlu

TL;DR
This paper introduces a novel multilevel memetic hypergraph partitioning algorithm with problem-specific operators, demonstrating superior solution quality over existing methods on real-world datasets within fixed computational budgets.
Contribution
It presents the first multilevel memetic algorithm for HGP with new recombination and mutation operators, improving solution quality over state-of-the-art heuristics.
Findings
Outperforms existing algorithms on 150 real-life instances.
Finds the best solutions in 112, 115, and 125 instances within 2, 4, and 8 hours.
Demonstrates significant quality improvements given the same computational resources.
Abstract
The Hypergraph Partitioning (HGP) problem is a well-studied problem that finds applications in a variety of domains. The literature on the HGP problem has heavily focused on developing fast heuristic approaches. In several application domains, such as the VLSI design and database migration planning, the quality of the solution is more of a concern than the running time of the algorithm. KaHyPar-E is the first multilevel memetic algorithm designed for the HGP problem and it returns better quality solutions, compared to the heuristic algorithms, if sufficient computation time is given. In this work, we introduce novel problem-specific recombination and mutation operators, and develop a new multilevel memetic algorithm by combining KaHyPar-E with these operators. The performance of our algorithm is compared with the state-of-the-art HGP algorithms on real-life instances taken from…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVLSI and FPGA Design Techniques · Constraint Satisfaction and Optimization · Scheduling and Optimization Algorithms
