Corrigendum to: ``Complexity and approximability of the happy set problem
From MaRDI portal
Publication:6076349
DOI10.1016/j.tcs.2023.114114OpenAlexW4386089162MaRDI QIDQ6076349
Ippei Terabaru, Eiji Miyano, Guo-Hui Lin, Yuichi Asahiro, Tesshu Hanaka, Hiroshi Eto
Publication date: 21 September 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114114
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work