KIT | KIT-Bibliothek | Impressum | Datenschutz

Benchmark Sets and Experimental Results for "High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing"

Maas, Nikolai ORCID iD icon 1
1 Institut für Theoretische Informatik (ITI), Karlsruher Institut für Technologie (KIT)

Abstract:

set_h.zip: benchmark set of 50 small to medium hypergraphs with 2-dimensional node weights (unit weights, degree)

set_v.zip: benchmark set of 27 small to medium hypergraphs from VLSI design with 3-dimensional node weights (unit weights, degree, area of component)

set_v_prime.zip: identical to Set V, but with 3 additional weight dimensions containing uniform random weights (6 dimensions in total)

set_r.zip: benchmark set of 33 large regular graphs (i.e., graphs with low degree variance, such as mesh graphs) with 2-dimensional node weights (unit weights, degree)

set_i.zip: benchmark set of 34 large irregular graphs (i.e., graphs with high degree variance, such as social networks) with 2-dimensional node weights (unit weights, degree)

stats_hg.csv: general statistics for Set H

stats_vlsi.csv: general statistics for Set V

stats_regular.csv: general statistics for Set R

stats_irregular.csv: general statistics for Set I

results_ablation.zip: experimental results for our ablation study

results_refinement.zip: experimental results for our evaluation of refinement algorithms

results_fallback.zip: experimental results for our evaluation of fallback rating functions
... mehr


Download
Originalveröffentlichung
DOI: 10.5281/zenodo.19630135
Zugehörige Institution(en) am KIT Institut für Theoretische Informatik (ITI)
Publikationstyp Forschungsdaten
Publikationsjahr 2026
Identifikator KITopen-ID: 1000198981
HGF-Programm 46.21.02 (POF IV, LK 01) Cross-Domain ATMLs and Research Groups
Lizenz Creative Commons Namensnennung 4.0 International
Art der Forschungsdaten Dataset
Nachgewiesen in OpenAlex
KIT – Die Universität in der Helmholtz-Gemeinschaft
KITopen Landing Page