A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game (2018)
- Authors:
- USP affiliated authors: KOHAYAKAWA, YOSHIHARU - IME ; WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1007/978-3-319-77404-6_51
- Subjects: OTIMIZAÇÃO COMBINATÓRIA; ALGORITMOS PARA PROCESSAMENTO
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: Latin American Symposium on Theoretical Informatics - LATIN 2018
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
KOHAYAKAWA, Yoshiharu e MIYAZAWA, Flávio Keidi e WAKABAYASHI, Yoshiko. A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game. 2018, Anais.. Cham: Springer, 2018. Disponível em: https://doi.org/10.1007/978-3-319-77404-6_51. Acesso em: 14 fev. 2026. -
APA
Kohayakawa, Y., Miyazawa, F. K., & Wakabayashi, Y. (2018). A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-77404-6_51 -
NLM
Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game [Internet]. Proceedings. 2018 ;[citado 2026 fev. 14 ] Available from: https://doi.org/10.1007/978-3-319-77404-6_51 -
Vancouver
Kohayakawa Y, Miyazawa FK, Wakabayashi Y. A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game [Internet]. Proceedings. 2018 ;[citado 2026 fev. 14 ] Available from: https://doi.org/10.1007/978-3-319-77404-6_51 - Multidimensional cube packing
- Multidimensional cube packing
- A tight lower bound for the online bounded space hypercube bin packing problem
- 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
- Approximation and parameterized algorithms for balanced connected partition problems
- Cube packing
Informações sobre o DOI: 10.1007/978-3-319-77404-6_51 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2890455.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
