Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem (2000)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1137/S009753979631391X
- Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
- Language: Inglês
- Imprenta:
- Publisher: SIAM
- Publisher place: Philadelphia
- Date published: 2000
- Source:
- Título: Siam Journal on Computing
- ISSN: 0097-5397
- Volume/Número/Paginação/Ano: v. 29, n. 3, p. 1008-1029, 2000
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
MIYAZAWA, Flávio Keidi e WAKABAYASHI, Yoshiko. Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem. Siam Journal on Computing, v. 29, n. 3, p. 1008-1029, 2000Tradução . . Disponível em: https://doi.org/10.1137/S009753979631391X. Acesso em: 21 jan. 2026. -
APA
Miyazawa, F. K., & Wakabayashi, Y. (2000). Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem. Siam Journal on Computing, 29( 3), 1008-1029. doi:10.1137/S009753979631391X -
NLM
Miyazawa FK, Wakabayashi Y. Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem [Internet]. Siam Journal on Computing. 2000 ; 29( 3): 1008-1029.[citado 2026 jan. 21 ] Available from: https://doi.org/10.1137/S009753979631391X -
Vancouver
Miyazawa FK, Wakabayashi Y. Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem [Internet]. Siam Journal on Computing. 2000 ; 29( 3): 1008-1029.[citado 2026 jan. 21 ] Available from: https://doi.org/10.1137/S009753979631391X - Selfish 2D bin packing game
- Packing entering sets in kernel systems
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds
- Grafos e otimização combinatória
- Hypotraceable digraphs
- Some approximation results for the maximum agreement forest problem
- The maximum agreement forest problem: approximation algorithms and computational experiments
- Minimum t-spanners on subcubic graphs
- The 2-Decomposition Conjecture for a new class of graphs
- An algorithmforthe three-dimensional packing problem with asymptotic performance analysis
Informações sobre o DOI: 10.1137/S009753979631391X (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
