arXiv (OAI Expanded)open access
Submodular Maximization under Supermodular Constraint: Greedy Guarantees
data structures and algorithms, computational complexity
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 613954
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.