ReP USP - Resultado da busca

Trabalho de evento-anais periodico
Approximation and parameterized algorithms for balanced connected partition problems (2022)
Moura, Phablo Fernando Soares ; Ota, Matheus Jun ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: Conference on Algorithms and Discrete Applied Mathematics - CALDAM. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOURA, Phablo Fernando Soares e OTA, Matheus Jun e WAKABAYASHI, Yoshiko. Approximation and parameterized algorithms for balanced connected partition problems. Proceedings. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-95018-7_17. Acesso em: 27 nov. 2025. , 2022
APA
Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2022). Approximation and parameterized algorithms for balanced connected partition problems. Proceedings. Cham: Springer. doi:10.1007/978-3-030-95018-7_17
NLM
Moura PFS, Ota MJ, Wakabayashi Y. Approximation and parameterized algorithms for balanced connected partition problems [Internet]. Proceedings. 2022 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-030-95018-7_17
Vancouver
Moura PFS, Ota MJ, Wakabayashi Y. Approximation and parameterized algorithms for balanced connected partition problems [Internet]. Proceedings. 2022 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-030-95018-7_17
Artigo de periodico
Improved approximation algorithms for capacitated fault-tolerant k-Center (2018)
Fernandes, Cristina Gomes ; Paula, Samuel P. de; Pedrosa, Lehilton L. C
Source: Algorithmica. Unidade: IME
Subjects: CIÊNCIA DA COMPUTAÇÃO, CONFIABILIDADE DE SOFTWARE, ARQUITETURA ORIENTADA A SERVIÇOS, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e PAULA, Samuel P. de e PEDROSA, Lehilton L. C. Improved approximation algorithms for capacitated fault-tolerant k-Center. Algorithmica, v. 80, n. 3, p. 1041–1072, 2018Tradução . . Disponível em: https://doi.org/10.1007/s00453-017-0398-x. Acesso em: 27 nov. 2025.
APA
Fernandes, C. G., Paula, S. P. de, & Pedrosa, L. L. C. (2018). Improved approximation algorithms for capacitated fault-tolerant k-Center. Algorithmica, 80( 3), 1041–1072. doi:10.1007/s00453-017-0398-x
NLM
Fernandes CG, Paula SP de, Pedrosa LLC. Improved approximation algorithms for capacitated fault-tolerant k-Center [Internet]. Algorithmica. 2018 ; 80( 3): 1041–1072.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s00453-017-0398-x
Vancouver
Fernandes CG, Paula SP de, Pedrosa LLC. Improved approximation algorithms for capacitated fault-tolerant k-Center [Internet]. Algorithmica. 2018 ; 80( 3): 1041–1072.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s00453-017-0398-x
Artigo de periodico
Approximation algorithms for the Max-Buying problem with limited supply (2018)
Fernandes, Cristina Gomes ; Schouery, Rafael Crivellari Saliba
Source: Algorithmica. Unidade: IME
Subjects: TEORIA DOS JOGOS, ECONOMIA, CIÊNCIAS DO COMPORTAMENTO, ECONOMIA MATEMÁTICA, CIÊNCIA DA COMPUTAÇÃO, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e SCHOUERY, Rafael Crivellari Saliba. Approximation algorithms for the Max-Buying problem with limited supply. Algorithmica, v. 80, n. 11, p. 2973–2992, 2018Tradução . . Disponível em: https://doi.org/10.1007/s00453-017-0364-7. Acesso em: 27 nov. 2025.
APA
Fernandes, C. G., & Schouery, R. C. S. (2018). Approximation algorithms for the Max-Buying problem with limited supply. Algorithmica, 80( 11), 2973–2992. doi:10.1007/s00453-017-0364-7
NLM
Fernandes CG, Schouery RCS. Approximation algorithms for the Max-Buying problem with limited supply [Internet]. Algorithmica. 2018 ; 80( 11): 2973–2992.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s00453-017-0364-7
Vancouver
Fernandes CG, Schouery RCS. Approximation algorithms for the Max-Buying problem with limited supply [Internet]. Algorithmica. 2018 ; 80( 11): 2973–2992.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s00453-017-0364-7
Artigo de periodico
The k-hop connected dominating set problem: approximation and hardness (2017)
Coelho, Rafael S; Moura, Phablo Fernando Soares; Wakabayashi, Yoshiko
Source: Journal of Combinatorial Optimization. Unidade: IME
Subjects: COMBINATÓRIA, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COELHO, Rafael S e MOURA, Phablo Fernando Soares e WAKABAYASHI, Yoshiko. The k-hop connected dominating set problem: approximation and hardness. Journal of Combinatorial Optimization, v. 34, n. 4, p. 1060–1083, 2017Tradução . . Disponível em: https://doi.org/10.1007/s10878-017-0128-y. Acesso em: 27 nov. 2025.
APA
Coelho, R. S., Moura, P. F. S., & Wakabayashi, Y. (2017). The k-hop connected dominating set problem: approximation and hardness. Journal of Combinatorial Optimization, 34( 4), 1060–1083. doi:10.1007/s10878-017-0128-y
NLM
Coelho RS, Moura PFS, Wakabayashi Y. The k-hop connected dominating set problem: approximation and hardness [Internet]. Journal of Combinatorial Optimization. 2017 ; 34( 4): 1060–1083.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10878-017-0128-y
Vancouver
Coelho RS, Moura PFS, Wakabayashi Y. The k-hop connected dominating set problem: approximation and hardness [Internet]. Journal of Combinatorial Optimization. 2017 ; 34( 4): 1060–1083.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10878-017-0128-y
Artigo de periodico
Polynomial-time approximation schemes for circle and other packing problems (2016)
Miyazawa, Flávio K.; Pedrosa, Lehilton L. C.; Schouery, Rafael Crivellari Saliba; Sviridenko, Maxim; Wakabayashi, Yoshiko
Source: Algorithmica. Unidade: IME
Assunto: ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flávio K. et al. Polynomial-time approximation schemes for circle and other packing problems. Algorithmica, v. 76, n. 2, p. 536-568, 2016Tradução . . Disponível em: https://doi.org/10.1007/s00453-015-0052-4. Acesso em: 27 nov. 2025.
APA
Miyazawa, F. K., Pedrosa, L. L. C., Schouery, R. C. S., Sviridenko, M., & Wakabayashi, Y. (2016). Polynomial-time approximation schemes for circle and other packing problems. Algorithmica, 76( 2), 536-568. doi:10.1007/s00453-015-0052-4
NLM
Miyazawa FK, Pedrosa LLC, Schouery RCS, Sviridenko M, Wakabayashi Y. Polynomial-time approximation schemes for circle and other packing problems [Internet]. Algorithmica. 2016 ; 76( 2): 536-568.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s00453-015-0052-4
Vancouver
Miyazawa FK, Pedrosa LLC, Schouery RCS, Sviridenko M, Wakabayashi Y. Polynomial-time approximation schemes for circle and other packing problems [Internet]. Algorithmica. 2016 ; 76( 2): 536-568.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s00453-015-0052-4

USP Schools

ReP

Filtros

Authors

Subjects

Non normalized affiliation