arXiv (All)
open access
A $1/2$-Approximation for Pandora's Problem with Deadlines
Pandora's problem is a fundamental model of sequential search in which opening each box incurs a cost. We study the variant with deadlines, where each box has a publicly known deadline for both opening and selection. We prove that a simple threshold strategy achieves a $1/2$-approximation to the opt
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sequential Efficient Designs#1345432
- Avoiding reification: Heuristic effectiveness of mathematics and the prediction of the omega minus particle#736474
- CVE-2026-94399 — MEDIUM 6.5#1107891
- CVE-2026-94397 — MEDIUM 6.5#1107889
- On the Computational Complexity of Problems: Formalizing Sensitivity to Uncertainty and Parametric Complexity Classes#1201398
Record · ID 1298271
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive