Polynomial-time approximation schemes for circle packing problems (2014)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1007/978-3-662-44777-2_59
- Subjects: COMPUTABILIDADE E COMPLEXIDADE; ANÁLISE DE ALGORITMOS; MATEMÁTICA DISCRETA; ESTRUTURAS DE DADOS
- Keywords: packing problem; circle packing; strip packing; resource augmentation; strip packing problem
- Language: Inglês
- Imprenta:
- Source:
- Conference titles: European Symposium on Algorithms - ESA
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
MIYAZAWA, Flavio Keidi et al. Polynomial-time approximation schemes for circle packing problems. 2014, Anais.. Berlin: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-662-44777-2_59. Acesso em: 28 fev. 2026. -
APA
Miyazawa, F. K., Pedrosa, L. L. C., Schouery, R. C. S., Sviridenko, M., & Wakabayashi, Y. (2014). Polynomial-time approximation schemes for circle packing problems. In Algorithms - ESA 2014: 22nd Annual European Symposium Wroclaw, Poland, September 8-10, 2014, Proceedings. Berlin: Springer. doi:10.1007/978-3-662-44777-2_59 -
NLM
Miyazawa FK, Pedrosa LLC, Schouery RCS, Sviridenko M, Wakabayashi Y. Polynomial-time approximation schemes for circle packing problems [Internet]. Algorithms - ESA 2014: 22nd Annual European Symposium Wroclaw, Poland, September 8-10, 2014, Proceedings. 2014 ;[citado 2026 fev. 28 ] Available from: https://doi.org/10.1007/978-3-662-44777-2_59 -
Vancouver
Miyazawa FK, Pedrosa LLC, Schouery RCS, Sviridenko M, Wakabayashi Y. Polynomial-time approximation schemes for circle packing problems [Internet]. Algorithms - ESA 2014: 22nd Annual European Symposium Wroclaw, Poland, September 8-10, 2014, Proceedings. 2014 ;[citado 2026 fev. 28 ] Available from: https://doi.org/10.1007/978-3-662-44777-2_59 - 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
- 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
Informações sobre o DOI: 10.1007/978-3-662-44777-2_59 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
