Pandora Box problem with nonobligatory inspection: hardness and approximation scheme

DOI10.1145/3564246.3585229MaRDI QIDQ6499267zbMATH OpenWikidataFDO

Authors Hu Fu, Jiawei Li, Daogao Liu

Publication date 8 May 2024

Full work available at URL https://doi.org/10.1145/3564246.3585229

zbMATH Keywords

approximation algorithmsNP-hardnessonline algorithmsPandora Box

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A PTAS for a class of stochastic dynamic programs
• Beating greedy for stochastic bipartite matching
• How to probe for an extreme value
• scientific article; zbMATH DE number 3638998 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Optimal Search for the Best Alternative
• The price of information in combinatorial optimization
• Whether or not to open Pandora's box

Cited in

(4)

• Pandora's box problem with time constraints
• Matching with nested and bundled Pandora boxes
• Pandora's box problem over time
• Designing exploration contracts

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499267)