Andreas Wiese

Departamento de Ingenieria Industrial
Facultad de Ciencias Fisicas y Matematicas
Universidad de Chile
Beauchef 851 Of. 705 Piso 7
Santiago Centro
CHILE

Research Interests

• Combinatorial optimization

• Approximation algorithms

• Packing problems

• Geometric problems

• Scheduling

---

Grants

• Optimization algorithms for geometric problems (Fondecyt Regular, Principle Investigator)

• Approximation algorithms for packing problems (Fondecyt Regular, Principle Investigator)

• Desarrollo de tecnologías para el control de la evasión en el transporte público (Fondef, Co-Investigator)
  

• Fast Approximation Algorithms for Massive Data Sets (Conicyt, Co-Investigator)
  
  
• Approximation algorithms for packing problems (assigned Emmy-Noether Project, DFG, Principle Investigator)

• Postdoc research grant (German Academic Exchange Service (DAAD), Principle Investigator)

---

Advising

• Postdocs: Kevin Schewior, Syamantak Das, Hang Zhou

• PhD student: Sandy Heydrich (co-advised with Rob van Stee)

• Master students: Cristobal Beltran, Tomas Martinez, Giorgi Nadiradze, Sabrina Robert, Sophie-Charlotte Bundle

---

Service to the academic community

• Organizer/Co-organizer of the annual research workshop on combinatorial optimization at the Universidad de Chile, 2016-2020

• Co-organizer of the summer school “XIII Escuela de Verano en Matematicas Discretas” in Valparaíso in 2018

• Organizer of the summer school ADFOCS 2015 at the MPI for Informatics in Saarbrücken

• Member of the program committees of APPROX 2021, LAGOS 2021, ESA 2020, WAOA 2019, SODA 2018, LATIN 2018, CIAC 2017, ESA 2015, APPROX 2015, WAOA 2015, WAOA 2014, MAPSP 2013, and WAOA 2012
  

• Editor of Information Processing Letters
  

• Reviewer for the Comisión Nacional de Investigación Científica y Tecnológica (CONICYT) in Chile, German Research Foundation (DFG), National Science Centre Poland, Natural Sciences and Engineering Research Council of Canada (NSERC), Israel Science Foundation (ISF) National Science Centre Poland and the Natural Sciences and Engineering Research Council of Canada (NSERC)

---

Selected Publications

For full list see DBLP

• Lars Rohwedder and Andreas Wiese
  A (2+epsilon)-approximation algorithm for preemptive weighted flow time on a single machine
  In Proceedings of the 53rd Annual ACM Symposium on the Theory of Computing (STOC 2021)

• Monika Henzinger, Stefan Neumann, and Andreas Wiese
  Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles
  In Proceedings of the 36th International Symposium on Computational Geometry (SoCG 2020)

• Anna Adamaszek, Sariel Har-Peled,  and Andreas Wiese
  Approximation Schemes for Independent Set and Sparse Subsets of Polygons
  Journal of the ACM (2019)

• Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, and Hang Zhou
  A (5/3+ε)-Approximation for Unsplittable Flow on a Path: Placing Small Tasks into Boxes
  In Proceedings of the 50th Annual ACM Symposium on the Theory of Computing (STOC 2018)
  

• Waldo Galvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan and Andreas Wiese
  Approximating Geometric Knapsack via L-packings
  In Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017)
  

• Fabrizio Grandoni, Tobias Mömke, Andreas Wiese and Hang Zhou
  To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack
  In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)

• Sandy Heydrich and Andreas Wiese
  Faster approximation schemes for the two-dimensional knapsack problem
  In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)
  ACM Transactions on Algorithms (2019)
  

• Giorgi Nadiradze and Andreas Wiese
  On approximating strip packing with a better ratio than 3/2
  In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016)

• Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo and Andreas Wiese
  Semidefinite and linear programming integrality gaps for scheduling identical machines
  In Proceedings of the 18th Conference on Integer Programming and Combinatorial Optimization (IPCO 2016)
  Mathematical Programming (2018)

• Anna Adamaszek, Parinya Chalermsook, Alina Ene and Andreas Wiese
  Submodular Unsplittable Flow on Trees
  In Proceedings of the 18th Conference on Integer Programming and Combinatorial Optimization (IPCO 2016)
  Mathematical Programming (2018)
  

• Jatin Batra, Naveen Garg, Amit Kumar, Tobias Mömke, and Andreas Wiese
  New Approximation Schemes for Unsplittable Flow on a Path
  In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)

• Anna Adamaszek and Andreas Wiese
  A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem
  In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)

• Anna Adamaszek and Andreas Wiese
  A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices
  In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014)

• Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, and Andreas Wiese
  A Mazing 2+ε Approximation for Unsplittable Flow on a Path
  In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014)
  ACM Transactions on Algorithms (2018)
  

• Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Nicole Megow, and Andreas Wiese
  Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
  In Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013)

• Anna Adamaszek and Andreas Wiese
  Approximation Schemes for Maximum Weight Independent Set of Rectangles
  In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013)

• Elisabeth Günther, Olaf Maurer, Nicole Megow, and Andreas Wiese
  A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
  In Proceedings of the 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013)
  ACM Transactions on Algorithms (2016)
  

• Paul Bonsma, Jens Schulz, and Andreas Wiese
  A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
  In Proceedings of the 52th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011)
  SIAM Journal on Computing (2014)

---

Teaching

• Theory of machine learning, Universidad de Chile, fall term 2021

• Modeling and optimization, Universidad de Chile, fall term 2021

• Operations research, Universidad de Chile, spring term 2020

• Research seminar, Universidad de Chile, spring term 2020

• Modeling and optimization, Universidad de Chile, fall term 2020

• Modeling and optimization, Universidad de Chile, spring term 2019

• Fixed-parameter algorithms, Universidad de Chile, fall term 2019

• Modeling and optimization, Universidad de Chile, spring term 2018

• Topics in Discrete Mathematics (Online algorithms and Scheduling), Universidad de Chile, fall term 2018

• Modeling and optimization, Universidad de Chile, fall term 2018

• Topics in Discrete Mathematics (FPT-algorithms), Universidad de Chile, spring term 2017

• Modelamiento y Optimizacion , Universidad de Chile, fall term 2017

• Modeling and optimization, Universidad de Chile, fall term 2017

• Modeling and optimization, Universidad de Chile, spring term 2016

• Optimization, MPI for Informatics, summer term 2016

• Approximation algorithms and hardness of approximation, MPI for Informatics, winter term 2015/16

• Approximation algorithms and hardness of approximation, MPI for Informatics, summer term 2014

---