Forschungsbericht 2023

Algorithmen und Komplexität E-11

Leitung: Mnich, Matthias

Institut auf TORE
Institutswebsite

Publikationen

• Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding - Conference Paper
  Kulik, Ariel; Mnich, Matthias; Shachnai, Hadas
  IEEE Annual Symposium on Foundations of Computer Science (FOCS 2023)
  Publisher DOI
  
  
• A (3/2 + ε)-Approximation for multiple TSP with a variable number of depots - Conference Paper
  Deppert, Max; Kaul, Matthias; Mnich, Matthias
  European Symposium on Algorithms (ESA 2023)
  Open Access | Publisher DOI
  
  
• Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs - Conference Paper
  Galby, Esther; Munaro, Andrea; Yang, Shizhou
  International Symposium on Computational Geometry (SoCG 2023)
  Publisher DOI
  
  
• High multiplicity N-fold IP via configuration LP - Journal Article
  Knop, Dušan; Koutecký, Martin; Levin, Asaf; Mnich, Matthias; Onn, Shmuel
  Mathematical Programming (2023)
  Open Access | Publisher DOI
  
  
• Approximation algorithms for coupled task scheduling minimizing the sum of completion times - Journal Article
  Fischer, David Simon; Györgyi, Péter
  Annals of Operations Research (2023)
  Open Access | Publisher DOI
  
  
• Approximations for many-visits multiple traveling salesman problems - Journal Article
  Bérczi, Kristóf; Mnich, Matthias; Vincze, Roland
  Omega : the international journal of management science (2023)
  Open Access | Publisher DOI
  
  
• The complexity of blocking (semi)total dominating sets with edge contractions - Journal Article
  Galby, Esther
  Theoretical Computer Science (2023)
  Publisher DOI
  
  
• Recent advances in practical data reduction - Book Part
  Abu-Khzam, Faisal N.; Lamm, Sebastian; Mnich, Matthias; Noe, Alexander; Schulz, Christian; Strash, Darren
  in: Algorithms for Big Data. Lecture Notes in Computer Science, vol 13201. Springer, Cham. (2023)
  Open Access | Publisher DOI
  
  
• Space-efficient parameterized algorithms on graphs of low shrubdepth - Conference Paper
  Bergougnoux, Benjamin; Chekan, Vera; Ganian, Robert; Kanté, Mamadou Moustapha; Mnich, Matthias; Oum, Sang-il; Pilipczuk, Michał; Leeuwen, Erik Jan van
  European Symposium on Algorithms (ESA 2023)
  Open Access | Publisher DOI
  
  
• New support size bounds for integer programming, applied to makespan minimization on uniformly related machines - Conference Paper
  Berndt, Sebastian; Brinkop, Hauke; Jansen, Klaus; Mnich, Matthias; Stamm, Tobias
  International Symposium on Algorithms and Computation (ISAAC 2023)
  Open Access | Publisher DOI
  
  
• Checkpoint placement for systematic fault-injection campaigns - Conference Paper
  Dietrich, Christian; Thomas, Tim-Marek; Mnich, Matthias
  IEEE/ACM International Conference on Computer-Aided Design (ICCAD 2023)
  Open Access | Publisher DOI
  
  

Projekte

• Flugplan - Ganzheitliche Fluglandeplanung mit reduzierter Lärm-und Schadstoffemission
  Hamburg Innovation GmbH; Laufzeit 2022-2023
  Projektleitung: Mnich, Matthias
  
  
• Data-driven decentralized energy trading
  Behörde für Wissenschaft, Forschung und Gleichstellung; Laufzeit 2021-2024
  Projektleitung: Mnich, Matthias
  
  
• SAMOP - Simultaneous approximation of multi-criteria optimization problems
  Deutscher Akademischer Austauschdienst (DAAD); Laufzeit 2021-2023
  Projektleitung: Mnich, Matthias
  
  
• Multivariate Algorithmen für Scheduling mit hoher Multiplizität
  Deutsche Forschungsgemeinschaft (DFG); Laufzeit 2019-2024
  Projektleitung: Mnich, Matthias