Pandora Box problem with nonobligatory inspection: hardness and approximation scheme

DOI10.1145/3564246.3585229WikidataQ130980220 ScholiaQ130980220MaRDI QIDQ6499267

Jiawei Li, Daogao Liu, Hu Fu

Publication date: 8 May 2024

zbMATH Keywords

online algorithmsapproximation algorithmsNP-hardnessPandora Box

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Whether or not to open Pandora's box
• How to probe for an extreme value
• Optimal Search for the Best Alternative
• Beating Greedy for Stochastic Bipartite Matching

This page was built for publication: Pandora Box problem with nonobligatory inspection: hardness and approximation scheme