Robust Algorithms under Adversarial Injections

by   Paritosh Garg, et al.

In this paper, we study streaming and online algorithms in the context of randomness in the input. For several problems, a random order of the input sequence—as opposed to the worst-case order—appears to be a necessary evil in order to prove satisfying guarantees. However, algorithmic techniques that work under this assumption tend to be vulnerable to even small changes in the distribution. For this reason, we propose a new adversarial injections model, in which the input is ordered randomly, but an adversary may inject misleading elements at arbitrary positions. We believe that studying algorithms under this much weaker assumption can lead to new insights and, in particular, more robust algorithms. We investigate two classical combinatorial-optimization problems in this model: Maximum matching and cardinality constrained monotone submodular function maximization. Our main technical contribution is a novel streaming algorithm for the latter that computes a 0.55-approximation. While the algorithm itself is clean and simple, an involved analysis shows that it emulates a subdivision of the input stream which can be used to greatly limit the power of the adversary.


page 1

page 2

page 3

page 4


Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization

We consider maximizing a monotone submodular function under a cardinalit...

Cardinality constrained submodular maximization for random streams

We consider the problem of maximizing submodular functions in single-pas...

Random-Order Models

This chapter introduces the random-order model in online algorithms. In ...

Deletion Robust Submodular Maximization over Matroids

Maximizing a monotone submodular function is a fundamental task in machi...

Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams

Many tasks in machine learning and data mining, such as data diversifica...

Stream Clipper: Scalable Submodular Maximization on Stream

Applying submodular maximization in the streaming setting is nontrivial ...

Streaming complexity of CSPs with randomly ordered constraints

We initiate a study of the streaming complexity of constraint satisfacti...