3 papers
cs.DS2025
Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
Niv Buchbinder, Joseph, Naor +1
We introduce the \emph{submodular objectives chasing problem}, which generalizes many natural and previously-studied problems: a sequence of constrained submodular maximization pro…
cs.DS2025
Dimension-Free Correlated Sampling for the Hypersimplex
Joseph, Naor, Nitya Raju +4
Sampling from multiple distributions so as to maximize overlap has been studied by statisticians since the 1950s. Since the 2000s, such correlated sampling from the probability sim…
cs.DS2024
Online Dependent Rounding Schemes for Bipartite Matchings, with Applications
Joseph, Naor, Aravind Srinivasan +1
We introduce the abstract problem of rounding an unknown fractional bipartite -matching revealed online (e.g., output by an online fractional algorithm), exposed node-b…