skip to main content
Idioma:
Refinado por: assunto: Otimização Combinatória remover
Result Number Material Type Add to My Shelf Action Record Details and Options
1
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game

Yoshiharu Kohayakawa Flávio Keidi Miyazawa; Yoshiko Wakabayashi; Latin American Symposium on Theoretical Informatics - LATIN 2018 (13. 2018 Buenos Aires, Argentina)

Proceedings Cham: Springer, 2018

Cham Springer 2018

Localização: IME - Inst. Matemática e Estatística    (PROD-2890455 )(Acessar)

2
Approximations for the Steiner multicycle problem
Approximations for the Steiner multicycle problem
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Approximations for the Steiner multicycle problem

Cristina Gomes Fernandes 1966- Carla Negri Lintzmayer; Phablo Fernando Soares Moura; Latin American Symposium on Theoretical Informatics - LATIN (22 2022 Guanajuato, Mexico)

Proceedings Cham : Springer, 2022

Cham 2022

Localização: IME - Inst. Matemática e Estatística    (PROD-3104069 )(Acessar)

3
Approximation algorithms for the max-buying problem with limited supply
Approximation algorithms for the max-buying problem with limited supply
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Approximation algorithms for the max-buying problem with limited supply

Cristina Gomes Fernandes 1966- Rafael Crivellari Saliba Schouery; Latin American on Theoretical Informatics Symposium - LATIN 2014 (11. 2014 Montevideo)

LATIN 2014: theoretical informatics: Proceedings Heidelberg: Springer, 2014

Heidelberg Springer 2014

Localização: IME - Inst. Matemática e Estatística    (PROD-2479779 )(Acessar)

4
Improved approximation algorithms for capacitated fault-tolerant k-center
Improved approximation algorithms for capacitated fault-tolerant k-center
Material Type:
Artigo de Congresso 		Adicionar ao Meu Espaço

Improved approximation algorithms for capacitated fault-tolerant k-center

Cristina Gomes Fernandes 1966- Samuel P. de Paula; Latin American Theoretical Informatics Symposium - LATIN (12. 2016 Ensenada)

Proceedings Berlin: Springer, 2016

Berlin Springer 2016

Localização: IME - Inst. Matemática e Estatística    (PROD-2758794 )(Acessar)

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.