11 citations · 11 across the 2 of their papers we have counts for
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.DS2010★ 11 cited
A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem
Paulo Feofiloff, Cristina G. Fernandes, Carlos E. Ferreira +1
The primal-dual scheme has been used to provide approximation algorithms for many problems. Goemans and Williamson gave a (2-1/(n-1))-approximation for the Prize-Collecting Steiner…