135 citations · 141 across the 14 of their papers we have counts for
3 papers · 1 filter
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
Y. Kohayakawa, F. K. Miyazawa, Y. Wakabayashi
We prove a tight lower bound on the asymptotic performance ratio of the bounded space online -hypercube bin packing problem, solving an open question raised in 2005. In the…
Online Circle and Sphere Packing
Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Eduardo Candido Xavier
In this paper we consider the Online Bin Packing Problem in three variants: Circles in Squares, Circles in Isosceles Right Triangles, and Spheres in Cubes. The two first ones recei…
Prices of anarchy of selfish 2D bin packing games
Cristina G. Fernandes, Carlos E. Ferreira, Flávio K. Miyazawa +1
We consider a game-theoretical problem called selfish 2-dimensional bin packing game, a generalization of the 1-dimensional case already treated in the literature. In this game, th…