Approximation and parameterized algorithms for balanced connected partition problems (2022)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1007/978-3-030-95018-7_17
- Assunto: ALGORITMOS DE APROXIMAÇÃO
- Keywords: Balanced connected partition; Parameterized algorithm
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: Conference on Algorithms and Discrete Applied Mathematics - CALDAM
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
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: 09 fev. 2026. , 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 2026 fev. 09 ] 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 2026 fev. 09 ] Available from: https://doi.org/10.1007/978-3-030-95018-7_17 - Packing in generalized kernel systems: a framework that generalizes packing of branchings
- Contribuições a teoria dos grafos e otimização combinatória
- Two-and three-dimensional parametric packing
- Tree 3-spanners on generalized prisms of graphs
- Quebra-cabecas e plano-decorte
- Cube packing
- Two- and three-dimensional parametric packing
- On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets
- Polyhedral and computational results on the k-hop connected dominating set problem
- Polynomial-time approximation schemes for circle packing problems
Informações sobre o DOI: 10.1007/978-3-030-95018-7_17 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
