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)
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)
A 5/3-approximation for finding spanning trees with many leaves in cubic graphs
Jose R Correa Cristina Gomes Fernandes 1966-; Martin Matamala; Yoshiko Wakabayashi; International Workshop on Approximation and Online Algorithms (5. 2007 Eilat, Israel)
Proceedings Berlin: Springer, 2008
Berlin Springer 2008
Localização:
IME - Inst. Matemática e Estatística
(PROD-1711613 ) e outros locais(Acessar)
The 2-Decomposition Conjecture for a new class of graphs
Fábio Happ Botler Andrea Jiménez; Maycon Sambinelli; Yoshiko Wakabayashi; Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS (11. 2021 São Paulo, Brasil)
Procedia Computer Science Amsterdam v. 195, p. 359-367, 2021
Amsterdam 2021
Localização:
IME - Inst. Matemática e Estatística
(PROD-3065393 )(Acessar)