2 papers
math.CO2023
On the structure of a smallest counterexample and a new class verifying the 2-Decomposition Conjecture
F. Botler, A. Jiménez, M. Sambinelli +1
The 2-Decomposition Conjecture, equivalent to the 3-Decomposition Conjecture stated in 2011 by Hoffmann-Ostenhof, claims that every connected graph with vertices of degree 2 an…
cs.DS2014
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…