scientific article; zbMATH DE number 7788450

DOI10.5555/3458064.3458176MaRDI QIDQ6147368zbMATH OpenFDO

Authors Michael Kapralov

Publication date 15 January 2024

Full work available at URL https://arxiv.org/abs/2103.11669

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(13)

• Improved bounds for matching in random-order streams
• Streaming edge coloring with asymptotically optimal colors
• Streaming algorithms for connectivity augmentation
• A simple (1-)-approximation semi-streaming algorithm for maximum (weighted) matching
• Weighted matching in the random-order streaming and robust communication models
• Maximum weight b-matchings in random-order streams
• Submodular maximization subject to matroid intersection on the fly
• Dynamic matching with better-than-2 approximation in polylogarithmic update time
• Sketching approximability of all finite CSPs
• Semi-streaming algorithms for weighted k-disjoint matchings
• Weighted matching in a poly-streaming model
• Streaming algorithms for network design
• A weighted-to-unweighted reduction for matroid intersection

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147368)