Robust algorithms under adversarial injections
From MaRDI portal
Cites work
- A threshold of ln n for approximating set cover
- An analysis of approximations for maximizing submodular set functions—I
- Approximate Maximum Matching in Random Streams
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Better bounds for matchings in the streaming model
- Better streaming algorithms for the maximum coverage problem
- Constructing a perfect matching is in random NC
- scientific article; zbMATH DE number 3698383 (Why is no real title available?)
- Improved bounds for randomized preemptive online matching
- Matching is as easy as matrix inversion
- Maximum matching in semi-streaming with few passes
- Online algorithms for maximum cardinality matching with edge arrivals
- Online matching with general arrivals
- Online matroid intersection: beating half for random arrival
- Paths, Trees, and Flowers
- Robust Algorithms for the Secretary Problem
- Secretary Problems with Non-Uniform Arrival Order
- Submodular maximization meets streaming: matchings, matroids, and more
- Submodular secretary problem with shortlists
- Submodular secretary problems: cardinality, matching, and linear constraints
- The one-way communication complexity of submodular maximization with applications to streaming and robustness
- Tight competitive ratios of classic matching algorithms in the fully online model
- Weighted Matchings via Unweighted Augmentations
This page was built for publication: Robust algorithms under adversarial injections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842517)
