2 papers
cs.DS2016
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center
Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
In the k-center problem, given a metric space V and a positive integer k, one wants to select k elements (centers) of V and an assignment from V to centers, minimizing the maximum…
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…