Sebastian Pokutta
Papers
1
Total Citations
233
H-Index
1
About
Sebastian Pokutta is a prominent researcher whose work spans optimization, machine learning, and combinatorial algorithms. His highly cited 2017 survey on approximation and online algorithms for multidimensional bin packing, which has accumulated over 233 citations, stands as a definitive reference in the field, synthesizing decades of algorithmic research on one of combinatorial optimization's most challenging and practically relevant problems. Bin packing and its multidimensional variants have critical applications in resource allocation, cloud computing, and logistics, making Pokutta's comprehensive treatment of both approximation guarantees and online algorithmic strategies particularly valuable to researchers and practitioners alike. His broader research agenda reflects a deep engagement with the theoretical foundations of optimization — including Frank-Wolfe methods, mixed-integer programming, and the interface between machine learning and mathematical optimization. Pokutta's contributions have shaped how researchers approach computationally hard problems, bridging rigorous theoretical analysis with real-world applicability. His work is widely recognized across the operations research and theoretical computer science communities, establishing him as a leading voice in modern optimization research.
Research Focus
Key Achievements
Top Papers
- 1Approximation and online algorithms for multidimensional bin packing: A survey233 citations · 2017