Improved approximation algorithms for capacitated fault-tolerant k-center
Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
ARTIGO
Inglês
In the -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 distance between an element of V and its assigned center. One of the most ge
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO - CNPQ
308523/2012-1; 477203/2012-4; 456792/2014-7
COORDENAÇÃO DE APERFEIÇOAMENTO DE PESSOAL DE NÍVEL SUPERIOR - CAPES
FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO - FAPESP
2013/03447-6; 2014/14209-1
fechado
Improved approximation algorithms for capacitated fault-tolerant k-center
Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
Improved approximation algorithms for capacitated fault-tolerant k-center
Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
Fontes
|
Algorithmica (Fonte avulsa) |