Koc University Digital Collectionsmetadata only
On the complexity and approximation of the maximum expected value all-or-nothing subset
computer science, computational complexity; approximation; polynomial; optimization problem
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 954991
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.