We consider the problem of maximizing a nonnegative submodular set function
f:2N→R+ subject to a p-matchoid
constraint in the single-pass streaming setting. Previous work in this context
has considered streaming algorithms for modular functions and monotone
submodular functions. The main result is for submodular functions that are {\em
non-monotone}. We describe deterministic and randomized algorithms that obtain
a Ω(p1)-approximation using O(klogk)-space, where k is
an upper bound on the cardinality of the desired set. The model assumes value
oracle access to f and membership oracles for the matroids defining the
p-matchoid constraint.Comment: 29 pages, 7 figures, extended abstract to appear in ICALP 201