Pandora Box problem with nonobligatory inspection: hardness and approximation scheme

DOI10.1145/3564246.3585229WikidataQ130980220 ScholiaQ130980220MaRDI QIDQ6499267FDOQ6499267

Authors: Hu Fu, Jiawei Li, Daogao Liu 

Publication date: 8 May 2024

zbMATH Keywords

online algorithmsapproximation algorithmsNP-hardnessPandora Box

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal Search for the Best Alternative
• How to probe for an extreme value
• The price of information in combinatorial optimization
• Whether or not to open Pandora's box
• Beating greedy for stochastic bipartite matching
• A PTAS for a class of stochastic dynamic programs

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)