3 papers
cs.DS2026
Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
Niels Grüttemeier, Nils Morawietz, Frank Sommer
Parameterized local search combines classic local search heuristics with the paradigm of parameterized algorithmics. While most local search algorithms aim to improve given solutio…
cs.DS2025
Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
Kaja Balzereit, Niels Grüttemeier, Nils Morawietz +3
In this work, we study the task of scheduling jobs on a single machine with sequence dependent family setup times under the goal of minimizing the makespan, that is, the completion…
cs.CC2024
Parameterized Local Search for Max -Cut
Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz +1
In the NP-hard Max -Cut problem, one is given an undirected edge-weighted graph and aims to color the vertices of with colors such that the total weight of edges wit…