Publication:5501355

zbMath1318.68180MaRDI QIDQ5501355

Friedrich Eisenbrand, Kurt Mehlhorn, Ernst Althaus, Stefan Funke

Publication date: 3 August 2015

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms

Related Items

An asymptotically exact algorithm for the high-multiplicity bin packing problem