Alexander Armbruster

According to our database, Alexander Armbruster authored at least 9 papers between 2023 and 2026.

Collaborative distances:

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

2026

Minimizing Weighted Flow Time.

Alexander Armbruster, Lars Rohwedder, Andreas Wiese

J. ACM, June, 2026

Improved Approximation Algorithms for Non-preemptive Throughput Maximization.

Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, Andreas Wiese

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

A (2 + ε)-approximation algorithm for the general scheduling problem in quasipolynomial time.

Alexander Armbruster, Lars Rohwedder, Andreas Wiese

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

Augmenting Packing Dynamic Programs to Handle (Many) Additional Budget Constraints.

Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, Andreas Wiese

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Multiplicative assignment with upgrades.

Alexander Armbruster, Lars Rohwedder, Stefan Weltge, Andreas Wiese, Ruilong Zhang

CoRR, April, 2025

On the Approximability of Unsplittable Flow on a Path with Time Windows.

Alexander Armbruster, Fabrizio Grandoni, Edin Husic, Antoine Tinguely, Andreas Wiese

Proceedings of the Integer Programming and Combinatorial Optimization, 2025

2024

Simpler constant factor approximation algorithms for weighted flow time - now for any <i>p</i>-norm.

Alexander Armbruster, Lars Rohwedder, Andreas Wiese

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

2023

Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm.

Alexander Armbruster, Lars Rohwedder, Andreas Wiese

CoRR, 2023

A PTAS for Minimizing Weighted Flow Time on a Single Machine.

Alexander Armbruster, Lars Rohwedder, Andreas Wiese

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023