15 citations · 28 across the 14 of their papers we have counts for
4 papers · 1 filter
Improved Upper Bounds for Dynamic Bin Packing of General, Unit-Fraction, and Power-Fraction Squares
Miguel A. Mini, Flávio K. Miyazawa, Gabriel M. Silva +1
This paper presents significant upper-bound improvements for dynamic 2D square bin packing, where square items arrive and depart over time and the objective is to minimize the peak…
Approximation and parameterized algorithms to find balanced connected partitions of graphs
Phablo F. S. Moura, Matheus J. Ota, Yoshiko Wakabayashi
Partitioning a connected graph into ~vertex-disjoint connected subgraphs of similar (or given) orders is a classical problem that has been intensively investigated since late se…
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…
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery +2
We give an asymptotic approximation scheme (APTAS) for the problem of packing a set of circles into a minimum number of unit square bins. To obtain rational solutions, we use augme…