Complexity and approximability of the happy set problem (vol 866, pg 123, 2021)

被引：0

作者：

Asahiro, Yuichi ^{[1
]}

Eto, Hiroshi ^{[2
]}

Hanaka, Tesshu ^{[3
]}

Lin, Guohui ^{[4
]}

Miyano, Eiji ^{[2
]}

Terabaru, Ippei ^{[2
]}

机构：

[1] Kyushu Sangyo Univ, Fukuoka, Japan

[2] Kyushu Inst Technol, Iizuka, Japan

[3] Kyushu Univ, Fukuoka, Japan

[4] Univ Alberta, Edmonton, AB, Canada

来源：

THEORETICAL COMPUTER SCIENCE | 2023年 / 975卷

关键词：

Happy set; Proper interval graph; Dynamic programming;

D O I：

10.1016/j.tcs.2023.114114

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

For a graph G = (V, E) and a subset S subset of V of vertices, a vertex is happy if all its neighbor vertices in G are contained in S. Given a connected undirected graph and an integer k, the Maximum Happy Set Problem (MaxHS) asks to find a set S of k vertices which maximizes the number of happy vertices in S (note that all happy vertices in V belong to S). We proposed an algorithm for MaxHS on proper interval graphs in Theor. Comput. Sci. 866 (2021) 123-144. However, due to a wrong observation made by the authors, it works only on proper interval graphs obeying the observation. In this corrigendum, we propose a new algorithm which runs in O(k vertical bar V vertical bar log k + vertical bar E vertical bar) time for proper interval graphs. (c) 2023 Elsevier B.V. All rights reserved.

引用

页数：7

共 50 条

[41] Set cover model-based optimum location of electric vehicle charging stations (vol 123, pg 1448, 2022)
Vansola, Binal
Minal
Shukla, Rena N.
CURRENT SCIENCE, 2023, 124 (03): : 370 - 370
[42] Set Squeezing Procedure for Quadratically Perturbed Chance-Constrained Programming (vol 69, pg 682, 2021)
He, Xin
Wu, Yik-Chung
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2021, 69 : 1664 - 1664
[43] Is this a behavior problem or normal temperament? (Reprinted from J Dev Behav Pediatr, vol 22, pg 123, 2001)
Stein, MT
Carey, W
Snyder, DM
Zweiback, M
Nathanson-Lippitt, L
Wessel, M
Stalker, N
PEDIATRICS, 2004, 114 (05) : 1400 - 1406
[44] Urinary System Iatrogenic Injuries: Problem Review (Expression of Concern of Vol 105, Pg 460, 2021)
Vorobev
UROLOGIA INTERNATIONALIS, 2022, 106 (10) : 1088 - 1088
[45] UNIQUENESS, LIPSCHITZ STABILITY, AND RECONSTRUCTION FOR THE INVERSE OPTICAL TOMOGRAPHY PROBLEM (vol 53, pg 6326, 2021)
Meftahi, Houcine
SIAM JOURNAL ON MATHEMATICAL ANALYSIS, 2024, 56 (06) : 8131 - 8135
[46] Social capital and the problem of opportunistic leadership: the example of Koreans in Japan (vol 52, pg 1, 2021)
Ramseyer, J. Mark
EUROPEAN JOURNAL OF LAW AND ECONOMICS, 2021,
[47] Early Buddhist Oral Transmission and the Problem of Accurate Source Monitoring (vol 12, pg 2715, 2021)
Analayo, Bhikkhu
MINDFULNESS, 2021, 12 (10) : 2569 - 2569
[48] Ancient genomes reveal early Andean farmers selected common beans while preserving diversity (vol 7, pg 123, 2021)
Trucchi, Emiliano
Benazzo, Andrea
Lari, Martina
Iob, Alice
Vai, Stefania
Nanni, Laura
Bellucci, Elisa
Bitocchi, Elena
Raffini, Francesca
Xu, Chunming
Jackson, Scott A.
Lema, Veronica
Babot, Pilar
Oliszewski, Nurit
Gil, Adolfo
Neme, Gustavo
Michieli, Catalina Teresa
De Lorenzi, Monica
Calcagnile, Lucio
Caramelli, David
Star, Bastiaan
de Boer, Hugo
Boessenkool, Sanne
Papa, Roberto
Bertorelle, Giorgio
NATURE PLANTS, 2021, 7 (03) : 377 - 377
[49] Toward a Quantum-Chemical Benchmark Set for Enzymatically Catalyzed Reactions: Important Steps and Insights (vol 123, pg 7057, 2019)
Wappett, Dominique A.
Goerigk, Lars
JOURNAL OF PHYSICAL CHEMISTRY A, 2020, 124 (05): : 1062 - 1062
[50] Existence of Pseudo-Relative Sharp Minimizers in Set-Valued Optimization ( vol 84 , pg 2969 , 2021)
Amahroq, Tijani
Oussarhan, Abdessamad
APPLIED MATHEMATICS AND OPTIMIZATION, 2024, 90 (01):

← 1 2 3 4 5 →