Marten Maack

According to our database, Marten Maack authored at least 22 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Server Cloud Scheduling.

Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop

Algorithmica, April, 2024

2023

Online cardinality constrained scheduling.

Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder

Oper. Res. Lett., September, 2023

Online bin covering with limited migration.

Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder

J. Comput. Syst. Sci., June, 2023

Online load balancing on uniform machines with limited migration.

Marten Maack

Oper. Res. Lett., May, 2023

Scheduling with Many Shared Resources.

Max A. Deppert, Klaus Jansen, Marten Maack, Simon Pukrop, Malin Rau

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

2022

Empowering the configuration-IP: new PTAS results for scheduling with setup times.

Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau

Math. Program., 2022

Cardinality Constrained Scheduling in Online Models.

Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.

Marten Maack, Simon Pukrop, Anna Rodriguez Rasmussen

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Full Version - Server Cloud Scheduling.

Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop

CoRR, 2021

Approximation Schemes for Machine Scheduling.

Marten Maack

Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021

Total Completion Time Minimization for Scheduling with Incompatibility Cliques.

Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020

Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments.

Daniel R. Page, Roberto Solis-Oba, Marten Maack

Theor. Comput. Sci., 2020

Structural parameters for scheduling with assignment restrictions.

Klaus Jansen, Marten Maack, Roberto Solis-Oba

Theor. Comput. Sci., 2020

Inapproximability Results for Scheduling with Interval and Resource Restrictions.

Marten Maack, Klaus Jansen

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Approximation Algorithms for Scheduling with Class Constraints.

Klaus Jansen, Alexandra Lassota, Marten Maack

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Solving Packing Problems with Few Small Items Using Rainbow Matchings.

Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Approximation Schemes for Machine Scheduling

Marten Maack

PhD thesis, 2019

Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times.

Klaus Jansen, Marten Maack, Malin Rau

ACM Trans. Algorithms, 2019

An EPTAS for Scheduling on Unrelated Machines of Few Different Types.

Klaus Jansen, Marten Maack

Algorithmica, 2019

Scheduling on (Un-)Related Machines with Setup Times.

Klaus Jansen, Marten Maack, Alexander Mäcker

Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times.

Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018

Estimating the Makespan of the Two-Valued Restricted Assignment Problem.

Klaus Jansen, Kati Land, Marten Maack

Algorithmica, 2018