betaFeedback

WorksComputer Science

Tight Bounds for Non-Monotone Submodular Maximization under a Cardinality Constraint with Constant Recourse

Machine checks

No machine checks are available from the Hub API for this paper.

Paper details

vlnc:W_x7zejbh2
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 1

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

GPT (multiple versions), Claude

View statement