Minimum-density locating-dominating sets on infinite hexagonal grids with bounded height (2025)
- Authors:
- USP affiliated authors: WAKABAYASHI, YOSHIKO - IME ; GOMES, ARTHUR CORREIA - IME
- Unidade: IME
- DOI: 10.1016/j.procs.2025.10.327
- Subjects: TEORIA DOS GRAFOS; COMBINATÓRIA
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: Elsevier BV
- Publisher place: Amsterdam
- Date published: 2025
- Source:
- Título: Procedia Computer Science
- ISSN: 1877-0509
- Volume/Número/Paginação/Ano: v. 273, , p.421-428, 2025
- Conference titles: Latin American Algorithms, Graphs, and Optimization Symposium - LAGOS
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
GOMES, Arthur Correia e WAKABAYASHI, Yoshiko. Minimum-density locating-dominating sets on infinite hexagonal grids with bounded height. Procedia Computer Science. Amsterdam: Elsevier BV. Disponível em: https://doi.org/10.1016/j.procs.2025.10.327. Acesso em: 26 jan. 2026. , 2025 -
APA
Gomes, A. C., & Wakabayashi, Y. (2025). Minimum-density locating-dominating sets on infinite hexagonal grids with bounded height. Procedia Computer Science. Amsterdam: Elsevier BV. doi:10.1016/j.procs.2025.10.327 -
NLM
Gomes AC, Wakabayashi Y. Minimum-density locating-dominating sets on infinite hexagonal grids with bounded height [Internet]. Procedia Computer Science. 2025 ; 273 421-428.[citado 2026 jan. 26 ] Available from: https://doi.org/10.1016/j.procs.2025.10.327 -
Vancouver
Gomes AC, Wakabayashi Y. Minimum-density locating-dominating sets on infinite hexagonal grids with bounded height [Internet]. Procedia Computer Science. 2025 ; 273 421-428.[citado 2026 jan. 26 ] Available from: https://doi.org/10.1016/j.procs.2025.10.327 - Locating-dominating sets on infinite grids with finite 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.1016/j.procs.2025.10.327 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3281678.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
