Evaluation of Local Search Heuristics for Graph Partitioning with Large k

  • Forschungsthema:Graph Partitioning, Local Search Algorithms, Integer Linear Programing
  • Typ:Bachelorarbeit
  • Datum:July 2022
  • Betreuung:

    Daniel Seemaier

    Tobias Heuer

  • Bearbeitung:

    Cedrico Knoesel