Pandora's Box Problem with Order Constraints

Author:

Boodaghians Shant1,Fusco Federico2,Lazos Philip2,Leonardi Stefano2

Affiliation:

1. University of Illinois at Urbana-Champaign, Urbana, IL, USA

2. Sapienza University of Rome, Rome, Italy

Funder

European Research Council

Ministero dellðIstruzione, dellðUniversità e della Ricerca

Publisher

ACM

Reference25 articles.

1. Stochastic Graph Exploration. In ICALP (LIPIcs), Vol. 132;Anagnostopoulos Aris;Schloss Dagstuhl - Leibniz-Zentrum für Informatik,2019

2. Hedyeh Beyhaghi and Robert Kleinberg. 2019. Pandora's Problem with Nonobligatory Inspection. In EC. ACM 131--132. Hedyeh Beyhaghi and Robert Kleinberg. 2019. Pandora's Problem with Nonobligatory Inspection. In EC. ACM 131--132.

3. (Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing. In APPROX-RANDOM (LIPIcs), Vol. 145;Bradac Domagoj;Schloss Dagstuhl - Leibniz-Zentrum für Informatik,2019

4. Improved non-approximability results for minimum vertex cover with density constraints

5. Whether or not to open Pandora's box

Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Prophet Secretary Against the Online Optimal;Proceedings of the 24th ACM Conference on Economics and Computation;2023-07-07

2. Pandora's Problem with Combinatorial Cost;Proceedings of the 24th ACM Conference on Economics and Computation;2023-07-07

3. Pandora’s Problem with Nonobligatory Inspection: Optimal Structure and a PTAS;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Pandora Box Problem with Nonobligatory Inspection: Hardness and Approximation Scheme;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

5. Pandora’s Box Problem with Order Constraints;Mathematics of Operations Research;2023-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3