Greedy Heuristics for Judicious Hypergraph Partitioning

Authors Noah Wahl, Lars Gottesbüren

Thumbnail PDF


  • Filesize: 2.02 MB
  • 16 pages

Document Identifiers

Author Details

Noah Wahl
  • Karlsruhe Institute of Technology, Germany
Lars Gottesbüren
  • Karlsruhe Institute of Technology, Germany

Cite AsGet BibTex

Noah Wahl and Lars Gottesbüren. Greedy Heuristics for Judicious Hypergraph Partitioning. In 21st International Symposium on Experimental Algorithms (SEA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 265, pp. 17:1-17:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)


We investigate the efficacy of greedy heuristics for the judicious hypergraph partitioning problem. In contrast to balanced partitioning problems, the goal of judicious hypergraph partitioning is to minimize the maximum load over all blocks of the partition. We devise strategies for initial partitioning and FM-style post-processing. In combination with a multilevel scheme, they beat the previous state-of-the-art solver - based on greedy set covers - in both running time (two to four orders of magnitude) and solution quality (18% to 45%). A major challenge that makes local greedy approaches difficult to use for this problem is the high frequency of zero-gain moves, for which we present and evaluate counteracting mechanisms.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Hypergraphs
  • Mathematics of computing → Graph algorithms
  • hypergraph partitioning
  • local search algorithms
  • load balancing
  • local search


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Charles J. Alpert. The ISPD98 Circuit Benchmark Suite. In International Symposium on Physical Design (ISPD), pages 80-85, April 1998. URL:
  2. Ivo Baar, Lukas Hübner, Peter Oettig, Adrian Zapletal, Sebastian Schlag, Alexandros Stamatakis, and Benoit Morel. Data Distribution for Phylogenetic Inference with Site Repeats via Judicious Hypergraph Partitioning. In IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2019, Rio de Janeiro, Brazil, May 20-24, 2019, pages 175-184. IEEE, 2019. URL:
  3. R Battiti, A Bertossi, and R Rizzi. Randomized Greedy Algorithms for the Hypergraph Partitioning Problem. Randomization Methods in Algorithm Design, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 43:21-35, 1999. URL:
  4. Anton Belov, Daniel Diepold, Marijn Heule, and Matti Järvisalo. The SAT Competition 2014., 2014.
  5. Béla Bollobás and Alex D. Scott. Judicious Partitions of Hypergraphs. Journal of Combinatorial Theory, 78(1):15-31, 1997. URL:
  6. Béla Bollobás and Alex D. Scott. Judicious Partitions of 3-uniform Hypergraphs. European Journal of Combinatorics, 21(3):289-300, 2000. URL:
  7. Béla Bollobás and Alex D. Scott. Judicious partitions of bounded-degree graphs. Journal of Graph Theory, 46(2):131-143, 2004. URL:
  8. Aydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, and Christian Schulz. Recent Advances in Graph Partitioning. In Algorithm Engineering - Selected Results and Surveys, volume 9220 of Lecture Notes in Computer Science, pages 117-158. Springer, 2016. URL:
  9. Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, and Dorothea Wagner. More Recent Advances in (Hyper) Graph Partitioning. ACM Computing Surveys, 2022. URL:
  10. Ümit V. Catalyurek and Cevdet Aykanat. Hypergraph-Partitioning-based Decomposition for Parallel Sparse-Matrix Vector Multiplication. IEEE Transactions on Parallel and Distributed Systems, 10(7):673-693, 1999. URL:
  11. Timothy A. Davis and Yifan Hu. The University of Florida Sparse Matrix Collection. ACM Transactions on Mathematical Software, 38(1):1:1-1:25, November 2011. URL:
  12. Elizabeth D. Dolan and Jorge J. Moré. Benchmarking Optimization Software with Performance Profiles. Mathematical Programming, 91(2):201-213, 2002. URL:
  13. Charles M. Fiduccia and Robert M. Mattheyses. A Linear-Time Heuristic for Improving Network Partitions. In 19th Conference on Design Automation (DAC), pages 175-181, 1982. URL:
  14. Lars Gottesbüren, Michael Hamann, Sebastian Schlag, and Dorothea Wagner. Advanced Flow-Based Multilevel Hypergraph Partitioning. 18th International Symposium on Experimental Algorithms (SEA), 2020. URL:
  15. Lars Gottesbüren, Tobias Heuer, and Peter Sanders. Parallel Flow-Based Hypergraph Partitioning. Technical report, Karlsruhe Institute of Technology, 2022. Google Scholar
  16. Lars Gottesbüren, Tobias Heuer, Peter Sanders, and Sebastian Schlag. Scalable Shared-Memory Hypergraph Partitioning. In 23st Workshop on Algorithm Engineering & Experiments (ALENEX). SIAM, January 2021. URL:
  17. Lars Gottesbüren, Tobias Heuer, Peter Sanders, and Sebastian Schlag. Shared-Memory n-level Hypergraph Partitioning. In 24th Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, January 2022. URL:
  18. Lars Gottesbüren. Parallel and Flow-Based High-Quality Hypergraph Partitioning. Dissertation, Karlsruhe Institute of Technology, 2022. Google Scholar
  19. John Haslegrave. The Bollobás-Thomason conjecture for 3-uniform hypergraphs. Combinatorica, 32(4):451-471, 2012. URL:
  20. Bruce Hendrickson and Robert W. Leland. A Multi-Level Algorithm For Partitioning Graphs. In Sidney Karin, editor, Proceedings Supercomputing '95, San Diego, CA, USA, December 4-8, 1995, page 28. ACM, 1995. URL:
  21. Tobias Heuer and Sebastian Schlag. Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure. In 16th International Symposium on Experimental Algorithms (SEA), pages 21:1-21:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, June 2017. URL:
  22. Jianfeng Hou, Shufei Wu, and Guiying Yan. On judicious partitions of uniform hypergraphs. Journal of Combinatorial Theory, 141:16-32, 2016. URL:
  23. George Karypis, Rajat Aggarwal, Vipin Kumar, and Shashi Shekhar. Multilevel Hypergraph Partitioning: Applications in VLSI Domain. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 7(1):69-79, 1999. URL:
  24. Kassian Kobert, Alexandros Stamatakis, and Tomáš Flouri. Efficient detection of repeating sites to accelerate phylogenetic likelihood calculations. Systematic biology, 66(2):205-217, 2017. Google Scholar
  25. Bernhard Misof, Shanlin Liu, Karen Meusemann, Ralph S Peters, Alexander Donath, Christoph Mayer, Paul B Frandsen, Jessica Ware, Tomáš Flouri, Rolf G Beutel, et al. Phylogenomics resolves the timing and pattern of insect evolution. Science, 346(6210):763-767, 2014. Google Scholar
  26. Laura A. Sanchis. Multiple-Way Network Partitioning. IEEE Transactions on Computers, 38(1):62-81, 1989. URL:
  27. Sebastian Schlag. High-Quality Hypergraph Partitioning. Dissertation, Karlsruhe Institute of Technology, 2020. URL:
  28. Farhad Shahrokhi and László A Székely. The complexity of the bottleneck graph bipartition problem. Journal of Combinatorial Mathematics and Combinatorial Computing, 15(94):221-226, 1994. Google Scholar
  29. Alexandros Stamatakis. Raxml version 8: a tool for phylogenetic analysis and post-analysis of large phylogenies. Bioinformatics, 30(9):1312-1313, 2014. URL:
  30. Alexandros Stamatakis and Nikolaos Alachiotis. Time and memory efficient likelihood-based tree searches on phylogenomic alignments with missing data. Bioinformatics, 26(12):i132-i139, 2010. Google Scholar
  31. Tunzi Tan, Jihong Gui, Sainan Wang, Suixiang Gao, and Wenguo Yang. An Efficient Algorithm for Judicious Partition of Hypergraphs. In Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II, volume 10628 of Lecture Notes in Computer Science, pages 466-474. Springer, 2017. URL:
  32. Natarajan Viswanathan, Charles J. Alpert, Cliff C. N. Sze, Zhuo Li, and Yaoguang Wei. The DAC 2012 Routability-Driven Placement Contest and Benchmark Suite. In 49th Conference on Design Automation (DAC), pages 774-782. ACM, June 2012. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail