The Correlated Pandora's Problem posed by Chawla et al. (2020) generalizes the classical Pandora's Problem by allowing the numbers inside the Pandora's boxes to be correlated. It also generalizes the Min Sum Set Cover problem, and is related to the Uniform Decision Tree problem. This paper gives an optimal 4-approximation for the Correlated Pandora's Problem, matching the lower bound of 4 from Min Sum Set Cover.

翻译：Chawla等人（2020）提出的相关潘多拉问题通过允许潘多拉盒子中的数字具有相关性，推广了经典的潘多拉问题。该问题同时推广了最小和集覆盖问题，并与均匀决策树问题相关。本文针对相关潘多拉问题提出了一个最优的4-近似算法，该结果与最小和集覆盖问题的下界4相匹配。