14 citations · 25 across the 8 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.SI2023
Parallel Unconstrained Local Search for Partitioning Irregular Graphs
Nikolai Maas, Lars Gottesbüren, Daniel Seemaier
We present new refinement heuristics for the balanced graph partitioning problem that break with an age-old rule. Traditionally, local search only permits moves that keep the block…
cs.DC2023★ 2 cited
Scalable High-Quality Hypergraph Partitioning
Lars Gottesbüren, Tobias Heuer, Nikolai Maas +2
Balanced hypergraph partitioning is an NP-hard problem with many applications, e.g., optimizing communication in distributed data placement problems. The goal is to place all nodes…