Name
Abstract | ||
|---|---|---|
Despite a surge of interest in submodular maximization in the data stream model, there remain significant gaps in our knowledge about what can be achieved in this setting, especially when dealing with multiple constraints. In this work, we nearly close several basic gaps in submodular maximization subject to $k$ matroid constraints in the data stream model. We present a new hardness result showing that super polynomial memory in $k$ is needed to obtain an $o(k / \log k)$-approximation. This implies near optimality of prior algorithms. For the same setting, we show that one can nevertheless obtain a constant-factor approximation by maintaining a set of elements whose size is independent of the stream size. Finally, for bipartite matching constraints, a well-known special case of matroid intersection, we present a new technique to obtain hardness bounds that are significantly stronger than those obtained with prior approaches. Prior results left it open whether a $2$-approximation may exist in this setting, and only a complexity-theoretic hardness of $1.91$ was known. We prove an unconditional hardness of $2.69$. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.4230/LIPICS.ESA.2022.52 | European Symposium on Algorithms (ESA) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Moran Feldman | 1 | 522 | 37.81 |
| Ashkan Norouzi-Fard | 2 | 5 | 5.84 |
| Ola Svensson | 3 | 349 | 36.31 |
| Rico Zenklusen | 4 | 307 | 33.70 |