Semi-streaming algorithms for submodular matroid intersection
From MaRDI portal
Publication:5925648
DOI10.1007/s10107-022-01858-9OpenAlexW3126430638WikidataQ114228482 ScholiaQ114228482MaRDI QIDQ5925648
Linus Jordan, Paritosh Garg, Ola Svensson
Publication date: 14 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-022-01858-9
Combinatorial aspects of matroids and geometric lattices (05B35) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Cites Work
- Submodular maximization meets streaming: matchings, matroids, and more
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On graph problems in a semi-streaming model
- Matroid Intersection
- Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
- Submodular Maximization with Cardinality Constraints
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Semi-streaming algorithms for submodular matroid intersection