1 Correction to: Algorithmica (2021) 83:853–878 https://doi.org/10.1007/s00453-020-00757-9
2 Introduction
An error was found by Xin Sun and Xianzhao Zhang in the proof of Theorem 3 in my paper “Guess Free Maximization of Submodular and Linear Sums” [1]. This document desribes this error, as well as some additional minor errors in the same paper, and then explains how all these errors can be fixed. I would like to thank Xin Sun and Xianzhao Zhang for pointing to me the error in the proof of Theorem 3.
3 Errors in the Statements of Theorems 2 and 3
Theorems 2 and 3 describe hardness results involving a linear function \(\ell \). Both theorems state the range of \(\ell \) as \({\mathbb {R}_{\ge 0}}\), which incorrectly implies that \(\ell \) is always non-negative. However, the true sign of \(\ell \) depends on the parameter r of these theorems. More specifically, \(\ell \) is non-negative when r is non-negative, and non-positive when r is non-positive (when r is zero, \(\ell \) is the zero function).
In addition to the above, Theorem 3 is stated twice in the paper. Once on Page 859, and once immediately before its proof on Page 870. Unfortunately, the restatement on Page 870 is incorrect (it is in fact a restatement of Theorem 2 rather than Theorem 3).
4 Error in the Proof of Theorem 3
The final step in the proof of Theorem 3 is showing that for a particular random set S and set function h, it holds that \(\mathbb {E}[h(S)] \ge \mathbb {E}[1 - e^{|S|/k} + \varepsilon ]\), where k and \(\varepsilon \) are given positive numbers. Towards this goal, the proof shows that
where r is another given number. The proof then argues the the right hand side of the last inequality is at least \(\mathbb {E}[1 - e^{|S|/k} + \varepsilon ]\). This argument is done by considering a few cases based on the value of r. The case in which an error was found is the case of \(r \in [-1, -1/e]\). In this case one can choose \(\lambda = -\ln (-r)\), to get that the right hand side of Inequality (1) is at least
To lower bound the last expression, the proof then considers the derivative of the expression within the expectation. Unfortunately, the derivative was not calculated correctly in the original proof. The correct derivative is
which is an increasing function of r that takes the value of 0 at \(r = -e^{-|S|/k}\). Therefore, Eq. (2) is minimized for this value of r, and since Eq. (2) lower bounds the right side of Inequality (1), this implies
which is what we needed to prove.
Reference
Feldman, M.: Guess free maximization of submodular and linear sums. Algorithmica 83(3), 853–878 (2021)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Feldman, M. Correction to: Guess Free Maximization of Submodular and Linear Sums. Algorithmica 84, 3101–3102 (2022). https://doi.org/10.1007/s00453-022-01028-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-022-01028-5