Locating-dominating sets on infinite grids with finite height (2025)
- Authors:
- USP affiliated authors: WAKABAYASHI, YOSHIKO - IME ; GOMES, ARTHUR CORREIA - IME
- Unidade: IME
- DOI: 10.5753/etc.2025.9150
- Assunto: TEORIA DOS GRAFOS
- Language: Inglês
- Imprenta:
- Publisher: SBC
- Publisher place: Porto Alegre
- Date published: 2025
- Source:
- Título: Anais - Resumo Expandido
- ISSN: 2595-6116
- Volume/Número/Paginação/Ano: p. 104-108, 2025
- Conference titles: Encontro de Teoria da Computação - ETC
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
GOMES, Arthur Correia e WAKABAYASHI, Yoshiko. Locating-dominating sets on infinite grids with finite height. 2025, Anais.. Porto Alegre: SBC, 2025. p. 104-108. Disponível em: https://sol.sbc.org.br/index.php/etc/article/view/36069/35856. Acesso em: 26 jan. 2026. -
APA
Gomes, A. C., & Wakabayashi, Y. (2025). Locating-dominating sets on infinite grids with finite height. In Anais - Resumo Expandido (p. 104-108). Porto Alegre: SBC. doi:10.5753/etc.2025.9150 -
NLM
Gomes AC, Wakabayashi Y. Locating-dominating sets on infinite grids with finite height [Internet]. Anais - Resumo Expandido. 2025 ; 104-108.[citado 2026 jan. 26 ] Available from: https://sol.sbc.org.br/index.php/etc/article/view/36069/35856 -
Vancouver
Gomes AC, Wakabayashi Y. Locating-dominating sets on infinite grids with finite height [Internet]. Anais - Resumo Expandido. 2025 ; 104-108.[citado 2026 jan. 26 ] Available from: https://sol.sbc.org.br/index.php/etc/article/view/36069/35856 - Minimum-density locating-dominating sets on infinite hexagonal grids with bounded height
- 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
- Selfish 2D bin packing game
- Packing entering sets in kernel systems
- Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem
- Some approximation results for the maximum agreement forest problem
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
- The maximum agreement forest problem: approximation algorithms and computational experiments
Informações sobre o DOI: 10.5753/etc.2025.9150 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3258301.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
