algorithm-engineering

推荐系统入门教程，在线阅读地址：https://datawhalechina.github.io/fun-rec/

KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisection based partitioning algorithms that compute solutions of very high quality.

KaHIP -- Karlsruhe HIGH Quality Partitioning.

Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with parallel implementations of techniques used in the best sequential partitioning algorithms. Mt-KaHyPar can partition extremely large hypergraphs very fast and with high quality.

Exercises for the Algorithm Engineering (ALE) course at University of Pisa

Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.

A list of all publications related to the KaHyPar frameworks.

Material for the AlgLab (Winter 2024/2025) @ TU Braunschweig

Experiment execution and result management for empirical evaluations of algorithms in Python.

Collection of our hypergraph partitioning experiments

Secretly a Master's Thesis

Graph Coloring implementation based on XRLF algorithm

Repo for Algorithm Engineering Projects Team: Suffering IRL