Speed-Robust Scheduling for Total Completion Timewith Nicole Megow, Morten Weber1 versionW_k536nsjxv1 · current
Scheduling on a Stochastic Number of MachinesMoritz Buchem, Franziska Eberle, Hugo Kooki Kasuya Rosado et al.0 citations2407.15737v12024arXiv
Approximating the Geometric Knapsack Problem in Near-Linear Time and DynamicallyMoritz Buchem, Paul Deuker, Andreas Wiese1 citation2403.00536v12024arXiv
A (3+ϵ)(3+\epsilon)(3+ϵ)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower boundsMoritz Buchem, Katja Ettmayr, Hugo Kooki Kasuya Rosado et al.0 citations2311.06111v12023arXiv
Scheduling with Machine ConflictsMoritz Buchem, Linda Kleist, Daniel Schmidt genannt Waldschmidt4 citations2102.08231v22021arXiv
Additive Approximation Schemes for Load Balancing ProblemsMoritz Buchem, Lars Rohwedder, Tjark Vredeveld et al.3 citations2007.09333v12020arXiv