Skip To Main Content
Simon Bartlmae on Muck Rack

Simon Bartlmae

Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Simon

Contact Simon, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

Computer Science > Computational Geometry

|
By Mikkel Abrahamsen, Arindam Khan, Simon Bartlmae
| arXiv
We consider the problem of online packing of convex polygons into a strip by translations. While online algorithms with a constant competitive ratio have been known for rectangles for decades [Baker and Schwarz, SICOMP 1983], the current best algorithm for convex polygons has competitive ratio $O(n^{\log_2 3-1}\log n) = O(n^{0.59})$, where $n$ is the number of polygons.
Open in Who Shared Issue with article?
See all 1 articles