Some approximation results for the maximum agreement forest problem
Estela Maris Rodrigues Marie-France Sagot; Yoshiko Wakabayashi; International Workshop on Approximation Algorithms for Combinatorial Optimization Problems - APPROX 2001 (4. 2001 Berkeley); International Workshop on Randomization and Approximation Techniques in ComputerScience - RANDOM 2001 (5. 2001 Berkeley)
Proceedings Berlin: Springer, 2001
Berlin Springer 2001
Localização:
IME - Inst. Matemática e Estatística
(PROD-1241364 ) e outros locais(Acessar)
A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
Cristina Gomes Fernandes 1966- Luis A. A Meira; Flavio Keidi Miyazawa; Lehilton L. C Pedrosa; International Workshop on Approximation Algorithms for Combinatorial Optimization - APPROX (15. 2012 Cambridge, MA); International Workshop on Randomization and Approximation Techniques in ComputerScience - RANDOM (16. 2012 Cambridge, MA)
Proceedings Berlin : Springer, 2012
Berlin Springer 2012
Localização:
IME - Inst. Matemática e Estatística
(PROD-2306003 ) e outros locais(Acessar)
Near-optimum universal graphs for graphs with bounded degrees
Noga Alon Michael Capalbo; Yoshiko Wakabayashi; Vojtech Rodl; Andrzej Rucinski; Endre Szemerédi; International Workshop on Approximation Algorithms for Combinatorial Optimization Problems - APPROX 2001 (4. 2001 Berkeley); International Workshop on Randomization and Approximation Techniques in ComputerScience - RANDOM 2001 (5. 2001 Berkeley)
Proceedings Berlin: Springer, 2001
Berlin Springer 2001
Localização:
IME - Inst. Matemática e Estatística
(PROD-1241370 ) e outros locais(Acessar)